Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction-Reference-Cited by-同舟云学术

Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction

Published:2019-03 Issue:2 Volume:53 Page:427-441
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Zhang Zhenzhen¹^ORCID,Luo Zhixing²^ORCID,Qin Hu³,Lim Andrew¹

Affiliation:

1. Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576

2. Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576; and School of Management and Engineering, Nanjing University, Nanjing 210093, China

3. School of Management, Huazhong University of Science and Technology, Wuhan 430000, China

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Reference35 articles.

1. Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

2. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

3. New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

4. New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows

5. A heuristic for the routing and carrier selection problem

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions;Computers & Operations Research;2024-12

2. Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework;Transportation Science;2024-07

3. A multi-objective optimization model for medical waste recycling network design under uncertainties;Transportation Research Part E: Logistics and Transportation Review;2024-04

4. A Multi-Round Combinatorial Double Auction for Carrier Collaboration with Carbon Emission Permits Trading in Less than Truckload Transportation;2024

5. A branch-and-price-and-cut algorithm for time-dependent pollution routing problem;Transportation Research Part C: Emerging Technologies;2023-11