A Study of Grouping Heuristicson Vehicle Scheduling ProblemBased on Changeable Expenditure Coefficient Model

A kind of vehicle scheduling problem(VSP) with non-full load and combined pick-up and delivery is studied, a changeable expenditure coefficient model according to the actual load is made,and grouping heuristicsalgorithmunder restrictions of vehicleload capacity、working time and mileage is designed t...

Full description

Saved in:
Bibliographic Details
Main Authors: Zeng, Yong (Author), Liu, Da-Cheng (Author), Li, Ju-Xuan (Author), Hou, Xiang-Yu (Author)
Format: EJournal Article
Published: Institute of Advanced Engineering and Science, 2013-01-10.
Subjects:
Online Access:Get fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 01726 am a22003013u 4500
001 ijeecs1978_817
042 |a dc 
100 1 0 |a Zeng, Yong  |e author 
100 1 0 |e contributor 
700 1 0 |a Liu, Da-Cheng  |e author 
700 1 0 |a Li, Ju-Xuan  |e author 
700 1 0 |a Hou, Xiang-Yu  |e author 
245 0 0 |a A Study of Grouping Heuristicson Vehicle Scheduling ProblemBased on Changeable Expenditure Coefficient Model 
260 |b Institute of Advanced Engineering and Science,   |c 2013-01-10. 
520 |a A kind of vehicle scheduling problem(VSP) with non-full load and combined pick-up and delivery is studied, a changeable expenditure coefficient model according to the actual load is made,and grouping heuristicsalgorithmunder restrictions of vehicleload capacity、working time and mileage is designed to minimize the number of vehicle、the distance of empty load and the useless freight turnover.By programming and calculating,an example proves the algorithm is feasible and effectual. DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1913 
540 |a Copyright (c) 2013 Institute of Advanced Engineering and Science 
540 |a http://creativecommons.org/licenses/by-nc-nd/4.0 
546 |a eng 
690
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |2 local 
786 0 |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 11, No 1: January 2013; 399-405 
786 0 |n 2502-4760 
786 0 |n 2502-4752 
786 0 |n 10.11591/ijeecs.v11.i1 
787 0 |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/1978/817 
856 4 1 |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/1978/817  |z Get fulltext