TITLE

Heuristic Algorithm for Min-max Vehicle Routing Problems

AUTHOR(S)
Chunyu Ren
PUB. DATE
April 2012
SOURCE
Journal of Computers;Apr2012, Vol. 7 Issue 4, p923
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In order to satisfy with the individual and various demand of customer, the present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; centers the longest route to design dual layered random operation to construct its neighborhood, to realize the strategy of optimizing between and within the route, to boost the efficiency and quality of the searching. Applies auto adaptive tabu length to control the searching capability dynamically; At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.
ACCESSION #
76108455

 

Related Articles

  • A Hybrid Tabu Search for Multi-Depots Collaborative Vehicle Routing Problem with Simultaneous Pickup and Delivery. Jin Li; Jianghua Zhang // Journal of Convergence Information Technology;Nov2012, Vol. 7 Issue 21, p416 

    Multi-depots collaborative vehicle routing problem with simultaneous pickup and delivery is an new extension of the classical Vehicle Routing Problem (VRP) with multiple collaborative depots, vehicles ' working time constraints, and two objective functions that account for not just for the...

  • PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. Rainer-Harbach, Marian; Papazek, Petrina; Raidl, Günther; Hu, Bin; Kloimüllner, Christian // Journal of Global Optimization;Nov2015, Vol. 63 Issue 3, p597 

    We consider a transportation problem arising in public bicycle sharing systems: To avoid rental stations to run entirely empty or full, a fleet of vehicles continuously performs tours moving bikes among stations. In the static problem variant considered in this paper, we are given initial and...

  • Heuristic for Vehicle Routing Problem with Release and Due Dates. Johar, Farhana; Potts, Chris; Bennell, Julia // AIP Conference Proceedings;2014, Vol. 1602, p594 

    research is classifies as non-classical Vehicle Routing Problem (VRP) where the maximum release date of customer's demand of the route determine the vehicle departure time. Thus, there could be lateness on the delivery process from awaiting all customers' demand of the route to be released. A...

  • Study on Multi Depot Heterogeneous Vehicle Routing Problem with an Improved Variable Neighborhood Search Algorithm. Yuexiang Yang; Yingcheng Xu; Li Wang // Information Technology Journal;2013, Vol. 12 Issue 23, p7137 

    This study deals with the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW) which is complex and still not resolved well. The objective is to determine the best fleet composition as well as the set of routes that minimize the total cost with known demands. To solve...

  • Driver's Workload Comparison in Waste Collection Vehicle Routing Problem. Benjamin, Aida Mauziah; Abdul-Rahman, Syariza // AIP Conference Proceedings;2016, Vol. 1782 Issue 1, p1 

    This paper compares the workload of the drivers for a waste collection benchmark problem. The problem involves ten data sets with different number of customers to be served and different number of disposal facilities available. Previous studies proposed a heuristic algorithm, namely Different...

  • Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution. Li, Peiqing; He, Jie; Zheng, Dunyong; Huang, Yongsheng; Fan, Chenhao // Discrete Dynamics in Nature & Society;8/13/2015, Vol. 2015, p1 

    Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with...

  • OPTIMIZACIÓN APLICADA A UN PROBLEMA DE RECOLECCIÓN DE RESIDUOS INDUSTRIALES. OSORTO, JAVIER ARIAS // Gerencia Tecnologica Informatica; 

    This paper show the second phase of research work developed about vehicle routing on Cerromatoso Inc. and presented at the Number 21 of this journal two years ago with title: "Transport scheduling applied to system of waste collection routes". On this phase, we considered the original problem...

  • Disrupted capacitated vehicle routing problem with order release delay. Mu, Qianxin; Eglese, Richard // Annals of Operations Research;Aug2013, Vol. 207 Issue 1, p201 

    With the popularity of the just-in-time system, more and more companies are operating with little or no inventories, which make them highly vulnerable to delays on supply. This paper discusses a situation when the supply of the commodity does not arrive at the depot on time, so that not enough...

  • Modeling the Time Windows Vehicle Routing Problem in Cross-docking Strategy Using Two Meta-heuristic Algorithms. Fakhrzada, M. B.; Sadri Esfahani, A. // International Journal of Engineering (1025-2495);Jul2014, Vol. 27 Issue 7, p1113 

    In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics