Mixed integer programming for vehicle routing problem with time windows

被引：0
|
作者：
Aggarwal D. [1 ]
Kumar V. [1 ]
机构：
[1] Computer Science and Engineering Department, Thapar University, Patiala, Punjab
来源：
International Journal of Intelligent Systems Technologies and Applications | 2019年 / 18卷 / 1-2期
关键词：
CPLEX; MIP; Mixed integer programming; Solomon’s instance; Time windows; Vehicle routing problem; VRP;
D O I：
10.1504/IJISTA.2019.097744
中图分类号：
学科分类号：
摘要：
Being a key element in logistics distribution, vehicle routing problem becomes an importance research topic in management and computation science. Vehicle routing problem (VRP) with time windows is a specialisation of VRP. In this paper, a brief description of VRP is presented. A mixed integer programming (MIP) is utilised to solve the vehicle routing problem with time windows (VRPTW). A novel mathematical model of MIP is formulated and implemented using IBM CPLEX. A novel constraint is designed to optimise the number of vehicle used. The proposed model is used to optimise both transportation cost and number of vehicle used simultaneously. The proposed model is tested on two well-known instances of Solomon’s benchmark test problem. Experimental results illustrate that the proposed formulation provides promising solutions in reasonable computation time. The sensitivity analysis of customer nodes is also studied. Copyright © 2019 Inderscience Enterprises Ltd.
引用
收藏
页码：4 / 19
页数：15
相关论文
共 50 条
  • [31] A Heuristic for the Vehicle Routing Problem with Time Windows
    Roberto Cordone
    Roberto Wolfler Calvo
    Journal of Heuristics, 2001, 7 (2) : 107 - 129
  • [32] The robust vehicle routing problem with time windows
    Agra, Agostinho
    Christiansen, Marielle
    Figueiredo, Rosa
    Hvattum, Lars Magnus
    Poss, Michael
    Requejo, Cristina
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (03) : 856 - 866
  • [33] A Vehicle Routing Problem with Flexible Time Windows
    Tas, Duygu
    Jabali, Ola
    Van Woensel, Tom
    COMPUTERS & OPERATIONS RESEARCH, 2014, 52 : 39 - 54
  • [34] The Vehicle Routing Problem with Time Windows and Time Costs
    Wang, Zhao
    Nakano, Yuusuke
    Nishimatsu, Ken
    21ST IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS ICDMW 2021, 2021, : 278 - 287
  • [35] An Integer Programming Model for the Capacitated Vehicle Routing Problem with Drones
    Wikarek, Jaroslaw
    Sitek, Pawel
    Zawarczynski, Lukasz
    COMPUTATIONAL COLLECTIVE INTELLIGENCE, PT I, 2019, 11683 : 511 - 520
  • [36] 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
  • [37] OPTIMIZATION ALGORITHM FOR THE TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH SOFTTIME WINDOWS: A RESEARCH BASED ON MIXED INTEGER MODEL AND MIXED TABU SEARCH
    Liao, Xiongxiong
    Shao, Yongyun
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2024,
  • [38] The green mixed fleet vehicle routing problem with partial battery recharging and time windows
    Macrina, Giusy
    Pugliese, Luigi Di Puglia
    Guerriero, Francesca
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 183 - 199
  • [39] The cumulative vehicle routing problem with arc time windows
    Kritikos, Manolis N.
    Metzidakis, Theocharis
    Ioannou, George
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 240
  • [40] 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
12345