Username   Password       Forgot your password?  Forgot your username? 

 

Modeling of Spare Parts Supply Route Optimization with Hard Time Windows

Volume 15, Number 2, February 2019, pp. 464-474
DOI: 10.23940/ijpe.19.02.p11.464474

Ming Han, Yabin Wang, and Zhonghua Cheng

Department of Management Engineering, the Army of Engineering University of PLA, Shijiazhuang, 050003, China

(Submitted on October 12, 2018; Revised on November 16, 2018; Accepted on December 10, 2018)

Abstract:

In view of the spare parts supply route problem with hard time windows in transportation, an optimal model that aims to minimize the total delivery time is put forward. In this paper, the supply route optimization problem with the shortest transportation distance as the decision target is discussed in detail. Taking the shortest total transportation distance of all vehicles as the optimization goal, a mathematical analytical model that considers the hard time window requirements of each customer is established. Based on the improved ant colony algorithm, the algorithm flow of solving the vehicle routing problem with hard time windows is designed to solve the difficulty of the model. In addition, the feasibility of the improved algorithm is verified by a case considering the actual terrain. The results show that the improved algorithm can quickly find the solution of VRPTW and provide an effective delivery plan for decision makers.

 

References: 19

        1. J. Brito, A. Expósito, and J. A. M. Pérez, “Bi-Objective Discrete PSO for Service-Oriented VRPTW,” Advances in Evolutionary and Deterministic Methods for Design, Vol. 36, pp. 445-460, 2015
        2. B. Ge, J. H. Han, Z. Wei, L. Cheng, and Y. Han, “Dynamic Hybrid Ant Colony Optimization Algorithm for Vehicle Routing Problem with Time Windows,” Pattern Recognition and Artificial Intelligence, Vol. 28, No. 7, pp. 641-650, July 2015
        3. Y. M. Guo, D. W. Hu, and X. Chen, “Solution of Emergency Logistics Open-Loop Vehicle Routing Problem with Time Windows based on Improved Ant Colony Algorithm,” Journal of Changan University (Natural Science Edition), Vol. 37, No. 6, pp. 105-112, November 2017
        4. K. Ilker, E. Seval, A. Asli, and O. Nursel, “A Memory Structure Adapted Simulated Annealing Algorithm for a Green Vehicle Routing Problem,” Environmental Science and Pollution Research, Vol. 22, No. 5, 2015
        5. K. N. Androutsopoulos and K. G. Zografos, “An Integrated Modelling Approach for the Bicriterion Vehicle Routing and Scheduling Problem with Environmental Considerations,” Transportation Research Part C: Emerging Technologies, Vol. 82, pp. 180-209, 2017
        6. P. V. Silvestrin and M. Ritt, “An Iterated Tabu Search for the Multi-Compartment Vehicle Routing Problem,” Computers and Operations Research, Vol. 81, pp. 192-202, 2017
        7. A. Utamima, K. R. Pradina, N. S. Dini, and H. Studiawan, “Distribution Route Optimization of Gallon Water using Genetic Algorithm and Tabu Search,” Procedia Computer Science, Vol. 72, pp. 503-510, 2015
        8. T. Y. Wu, J. H. Xu, J. Y. Liu, and L. Zan, “Improved Genetic Algorithm for Vehicle Routing Problem with Hard Time Window,” Systems Engineering and Electronics, Vol. 36, No. 4, pp. 708-713, April 2014
        9. H. Yousefi, R. T. Moghaddam, M. T. B. Oliaei, M. Mohammadi, and A. Mozaffari, “Solving a Bi-Objective Vehicle Routing Problem under Uncertainty by a Revised Multi-Choice Goal Programming Approach,” International Journal of Industrial Engineering Computation, Vol. 8, No. 3, pp. 283-302, 2017
        10. A. Alvarez and P. Munari, “An Exact Hybrid Method for the Vehicle Routing Problem with Time Windows and Multiple Deliverymen,” Computers and Operations Research, Vol. 83, pp. 1-12, 2017
        11. J. C. Paz, M. G. Echeverri, and J. W. Escobar, “The Multi-Depot Electric Vehicle Location Routing Problem with Time Windows,” International Journal of Industrial Engineering Computations, Vol. 9, No. 1, pp. 123-136, 2018
        12. F. Errico, G. Desaulniers, M. Gendreau, W. Rei, and L. M. Rousseau, “A Priori Optimization with Recourse for the Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times,” European Journal of Operational Research, Vol. 249, No. 1, pp. 55-66, 2016
        13. R. C. Funes, M. A. S. Aguilar, and V. Boyer, “Multi-Depot Periodic Vehicle Routing Problem with Due Dates and Time Windows,” Journal of the Operational Research Society, Vol. 69, No. 2, pp. 296-306, 2018
        14. S. Gao, “The Research of Vehicle Routing Problems with Time Windows based on Electric Vehicle,” Dalian Maritime University, 2015
        15. D. M. Miranda and S. V. Conceição, “The Vehicle Routing Problem with Hard Time Windows and Stochastic Travel and Service Time,” Expert Systems with Applications, Vol. 64, pp. 104-116, 2016
        16. V. A. Nguyen, J. Jiang, and K. M. Teo, “Satisficing Measure Approach for Vehicle Routing Problem with Time Windows under Uncertainty,” European Journal of Operational Research, Vol. 248, No. 2, pp. 404-414, 2016
        17. R. Spliet and A. F. Gabor, “The Time Window Assignment Vehicle Routing Problem,” Transportation Science, Vol. 49, No. 4, pp. 721-731, 2015
        18. L. J. Tan, F. Y. Lin, and H. Wang, “BFO Optimization Algorithms for Vehicle Routing Problem with Time Windows,” Applied Mechanics and Materials, Vol. 543-547, pp. 1884-1887, 2014
        19. Y. B. Wang, J. M. Zhao, X. S. Jia, and Y. Tian, “Spare Parts Allocation Optimization in a Multi-Echelon Support System based on Multi-Objective Particle Swarm Optimization Method,” Maintenance and Reliability, Vol. 16, No. 1, pp. 29-36, 2014

         

        Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

         
        This site uses encryption for transmitting your passwords. ratmilwebsolutions.com