### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Engineering and Computer Science |

Pages | 1532-1537 |

Number of pages | 6 |

Volume | 2 |

Publication status | Published - 2012 |

Event | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 - Kowloon Duration: 2012 Mar 14 → 2012 Mar 16 |

### Other

Other | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 |
---|---|

City | Kowloon |

Period | 12/3/14 → 12/3/16 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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

SN - 9789881925190

VL - 2

SP - 1532

EP - 1537

BT - Lecture Notes in Engineering and Computer Science

ER -