TY - GEN

T1 - Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA

AU - Shen, Yuxi

AU - Murata, Tomohiro

PY - 2012/1/1

Y1 - 2012/1/1

N2 - This study considers the application of a genetic algorithm (GA) to the basic vehide routing problem with tow-dimensional loading constraints (2L-CVRP). Vehicle routing problem encompasses a whole class of complex optimization problems that target the derivation of minimum total cost routes for a number of resources (vehicles, etc.) located at a central depot in order to service efficiently a number of demand customers. Several practical issues in the industry involving both production and transportation decisions are modeled as VRP instances and the hard combinatorial problems in the strong sense (NP-hard). 2L-CVRP is a generalization of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of rectangular, weighted items. In this paper, computational results are given for the pure GA which is put forward. As compare with the mathematic method, we can find the advantage of using GA to solve the problem especially in large sizeproblems.

AB - This study considers the application of a genetic algorithm (GA) to the basic vehide routing problem with tow-dimensional loading constraints (2L-CVRP). Vehicle routing problem encompasses a whole class of complex optimization problems that target the derivation of minimum total cost routes for a number of resources (vehicles, etc.) located at a central depot in order to service efficiently a number of demand customers. Several practical issues in the industry involving both production and transportation decisions are modeled as VRP instances and the hard combinatorial problems in the strong sense (NP-hard). 2L-CVRP is a generalization of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of rectangular, weighted items. In this paper, computational results are given for the pure GA which is put forward. As compare with the mathematic method, we can find the advantage of using GA to solve the problem especially in large sizeproblems.

KW - Vehicle routing problem; 2-dimesional Bin packing problem; Genetic algorithm; Capacity

UR - http://www.scopus.com/inward/record.url?scp=84867470090&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867470090&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867470090

SN - 9789881925190

T3 - Lecture Notes in Engineering and Computer Science

SP - 1532

EP - 1537

BT - International MultiConference of Engineers and Computer Scientists, IMECS 2012

PB - Newswood Limited

T2 - 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012

Y2 - 14 March 2012 through 16 March 2012

ER -