Two objective functions for a real life Split Delivery Vehicle Routing Problem

被引：0
|
作者：
Uldry, Marc [1 ]
Widmer, Marino [1 ]
Hertz, Alain [2 ]
机构：
[1] Univ Fribourg, Dept Informat, Decis Support & Operat Res, Fribourg, Switzerland
[2] Ecole Polytech, Dept Math & Genie Ind, Montreal, PQ, Canada
来源：
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT | 2011年
关键词：
Vehicle Routing Problem; Split Deliveries; Mixed Integer Programming; TIME WINDOWS; ALGORITHMS;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Different products have to be delivered by trucks. Due to the trucks capacity, each order is split into one or more deliveries supplied from a main depot or from local depots. Simple and complex constraints have to be satisfied as drivers and trucks availability or the fact that only specific trucks can be loaded in local depots. The problem is formulated as a MIP and considers two different objective functions. The first one defines a vehicle routing problem where the total travel time is minimized while the second one defines a VRP where the number of different trucks supplying each individual customer is minimized.
引用
收藏
页码：1290 / 1299
页数：10
相关论文
共 50 条
  • [21] Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
    Shi, Jianli
    Zhang, Jin
    Wang, Kun
    Fang, Xin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (02)
  • [22] Split Delivery Weighted Vehicle Routing Problem: Comparison Perspective
    Ma Yuyan
    Tang Jiafu
    Guan Jing
    2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, : 8436 - 8440
  • [23] A tabu search algorithm for the split delivery vehicle routing problem
    Archetti, C
    Speranza, MG
    Hertz, A
    TRANSPORTATION SCIENCE, 2006, 40 (01) : 64 - 73
  • [24] Improved lower bounds for the Split Delivery Vehicle Routing Problem
    Moreno, Lorenza
    de Aragao, Marcus Poggi
    Uchoa, Eduardo
    OPERATIONS RESEARCH LETTERS, 2010, 38 (04) : 302 - 306
  • [25] Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery
    Ren, Teng
    Luo, Tianyu
    Jia, Binbin
    Yang, Bihao
    Wang, Ling
    Xing, Lining
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 77
  • [26] Split delivery vehicle routing problem with time windows: a case study
    Latiffianti, E.
    Siswanto, N.
    Firmandani, R. A.
    INTERNATIONAL CONFERENCE ON INDUSTRIAL AND SYSTEMS ENGINEERING (ICONISE) 2017, 2018, 337
  • [27] Tabu search algorithm for the discrete split delivery vehicle routing problem
    Qiu M.
    Fu Z.
    Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2019, 40 (03): : 525 - 533
  • [28] Branch-and-cut algorithms for the split delivery vehicle routing problem
    Archetti, Claudia
    Bianchessi, Nicola
    Speranza, M. Grazia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (03) : 685 - 698
  • [29] Multi-Depot Split-Delivery Vehicle Routing Problem
    Lim, Hyunpae
    Lee, Gyu M.
    Singgih, Ivan Kristianto
    IEEE ACCESS, 2021, 9 (09): : 112206 - 112220
  • [30] Improved Ant Colony Algorithm for the Split Delivery Vehicle Routing Problem
    Ma, Xiaoxuan
    Liu, Chao
    APPLIED SCIENCES-BASEL, 2024, 14 (12):
12345