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

Yuxi Shen, Tomohiro Murata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Engineering and Computer Science
Pages1532-1537
Number of pages6
Volume2
Publication statusPublished - 2012
Event2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 - Kowloon
Duration: 2012 Mar 142012 Mar 16

Other

Other2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012
CityKowloon
Period12/3/1412/3/16

Fingerprint

Vehicle routing
Genetic algorithms
Scheduling
Costs
Industry

Keywords

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

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Shen, Y., & Murata, T. (2012). Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA. In Lecture Notes in Engineering and Computer Science (Vol. 2, pp. 1532-1537)

Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA. / Shen, Yuxi; Murata, Tomohiro.

Lecture Notes in Engineering and Computer Science. Vol. 2 2012. p. 1532-1537.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shen, Y & Murata, T 2012, Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA. in Lecture Notes in Engineering and Computer Science. vol. 2, pp. 1532-1537, 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012, Kowloon, 12/3/14.
Shen Y, Murata T. Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA. In Lecture Notes in Engineering and Computer Science. Vol. 2. 2012. p. 1532-1537
Shen, Yuxi ; Murata, Tomohiro. / Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA. Lecture Notes in Engineering and Computer Science. Vol. 2 2012. pp. 1532-1537
@inproceedings{2c21c8f1538b47f4b681245b30f98bc1,
title = "Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA",
abstract = "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.",
keywords = "Vehicle routing problem; 2-dimesional Bin packing problem; Genetic algorithm; Capacity",
author = "Yuxi Shen and Tomohiro Murata",
year = "2012",
language = "English",
isbn = "9789881925190",
volume = "2",
pages = "1532--1537",
booktitle = "Lecture Notes in Engineering and Computer Science",

}

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

Y1 - 2012

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

VL - 2

SP - 1532

EP - 1537

BT - Lecture Notes in Engineering and Computer Science

ER -