INTEGRATION OF VEHICLE ROUTING AND CONTAINER LOADING PROBLEM USING A HYBRID GENETIC ALGORITHM

摘要

This research recognizes the necessity of an integration of vehicle routing problem with simultaneous delivery and pickup at the same customer location and the container loading problem (VRPSDP-CLP). In a distribution system, these considerations are inherently related to each other. The objective of the problem is to minimize the total transportation costs that related to the type and the number of used vehicles, the distance or travel times to service all customers, each with a single stop, and the utilization of vehicles. In this paper, a combination of a genetic algorithm and a greedy algorithm are developed for solving the VRPSDP-CLP. Computational characteristics of the hybrid genetic algorithm are evaluated through computational experiments. The performance of the hybrid genetic algorithm is evaluated by comparing its results with optimization solutions for generated test problems.