Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows

被引:7
|
作者
Savitri, H. [1 ]
Kurniawati, D. A. [1 ]
机构
[1] Univ Islam Negeri Sunan Kalijaga, Fac Sci & Technol, Ind Engn Dept, Jalan Marsda Adisutjipto, Yogyakarta 55281, Indonesia
关键词
Optimization; vehicle routing problem; time windows; sweep algorithm; mixed integer linear programming; cluster first route second; distribution;
D O I
10.1142/S0219686718500282
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
CV. Jogja Transport is a company that distribute cakes "Sari Roti" in Yogyakarta, Indonesia. It has responsibility to distribute the cakes for every customer during the customers' time windows. The distribution problem of CV. Jogja Transport belongs to Vehicle Routing Problem with Time Window (VRPTW). This paper tries to solve the problem of CV. Jogja Transport by proposing "cluster first route second" algorithm of simple heuristic method. Then the algorithm is combined with sweep algorithm for clustering the customers and Mixed Integer Linear Programming (MILP) to select the best route so that it can minimize the distance of each cluster. The result indicate that implementation of sweep algorithm and MILP can reduce the distances and the fuel up to 10.95% and the travel distance up to 2.60%.
引用
收藏
页码:505 / 513
页数:9
相关论文
共 50 条
  • [1] Mixed integer programming for vehicle routing problem with time windows
    Aggarwal D.
    Kumar V.
    International Journal of Intelligent Systems Technologies and Applications, 2019, 18 (1-2) : 4 - 19
  • [2] Mixed ant colony algorithm for vehicle routing problem with time windows
    Wang, Jian
    Li, Hongyun
    Chen, Hong
    MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 855 - 858
  • [3] An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
    De La Vega, Jonathan
    Gendreau, Michel
    Morabito, Reinaldo
    Munari, Pedro
    Ordonez, Fernando
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (02) : 676 - 695
  • [4] A hybrid algorithm for the Vehicle Routing Problem with Time Windows
    Ribas, Sabir
    Subramanian, Anand
    Coelho, Igor Machado
    Ochi, Luiz Satoru
    Freitas Souza, Marcone Jamilson
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1243 - 1252
  • [5] A Hybrid Algorithm for Vehicle Routing Problem with Time Windows
    Jiang, Dengying
    Jiang, Wenxia
    Huang, Zhangcan
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2008, 5370 : 198 - 205
  • [6] A hybrid algorithm for vehicle routing problem with time windows
    Yu, B.
    Yang, Z. Z.
    Yao, B. Z.
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (01) : 435 - 441
  • [7] A Transgenic Algorithm for the Vehicle Routing Problem with Time Windows
    Ruiz-Vanoye, Jorge A.
    Diaz-Parra, Ocotlan
    Cocon, Felipe
    Buenabad-Arias, Angeles
    Canepa Saenz, Ana
    PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 138 - 143
  • [8] Genetic algorithm for vehicle routing problem with time windows
    Li, Dawei
    Wang, Li
    Wang, Mengguang
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 1999, 19 (08): : 65 - 69
  • [9] CLUSTERING ALGORITHM FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
    Thi Diem Chau Le
    Duc Duy Nguyen
    Olah, Judit
    Pakurar, Miklos
    TRANSPORT, 2022, 37 (01) : 17 - 27
  • [10] THE EVOLUTIONARY ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
    Szlachcic, Ewa
    APLIMAT 2005 - 4TH INTERNATIONAL CONFERENCE, PT II, 2005, : 381 - 387