It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
To solve the problem of efficient distribution of convenience store chains, this paper creates a multi-compartment vehicle routing problem model with time- windows (MCVRP-TW) to meet the goal of minimizing the total distribution cost. The solution is based on a hybrid genetic algorithm, which using the “destruction” and “repair” operators of the large-scale neighborhood search algorithm and the Metropolis criterion of simulated annealing for local search operations. The results show that the proposed multi-compartment vehicle routing model with time windows and the hybrid algorithm can meet the requirement of practical route design and reduce the total distribution cost.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 School of Economics & Management, Xiamen University of Technology