New compact integer programming formulations for the multi-trip vehicle routing problem with time windows

Neira, Daniel A.; Aguayo, Maichel M.; Fuente, Rodrigo De la; Klapp, Mathias A.

doi:10.1016/j.cie.2020.106399

Cited by 33 publications

(12 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zhang et al [16] study the fuzzy demand problem considering time window preference by breaking the one-way restriction of vehicles and introducing customers' time window preference in order to adapt the fuzzy demand VRP to the reality of multi-trip vehicle routing. Neira et al [17] build two integer planning (IP) models which are used for multi-trip VRPs including time windows, service-related loading times and finite trip durations.…”

Section: Multi-trip Vrp With Consideration Of Fuzzy Demands and Time ...mentioning

confidence: 99%

Review of research on vehicle routing problems

Hao,

Mao,

Wei

et al. 2024

International Conference on Smart Transportation and City Engineering (STCE 2023)

View full text Add to dashboard Cite

With the rise of the social logistics industry, the vehicle routing problem has always been a hot topic for scholars to study. This paper focuses on the recent research advances in the last 5 years of the vehicle routing problem, which contains the basic vehicle routing problem (VRP), vehicle routing problem with capacity constraints (CVRP), vehicle routing problem with time windows (VRPTW), split delivery vehicle routing problem (SDVRP), dynamic vehicle routing problem (DVRP), other types of VRPs, and so on. By subdividing the above according to VRP characteristics and describing its solution method. Finally, future research trends and development trends of VRP are summarized.

show abstract

Section: Multi-trip Vrp With Consideration Of Fuzzy Demands and Time ...mentioning

confidence: 99%

Review of research on vehicle routing problems

Hao,

Mao,

Wei

et al. 2024

International Conference on Smart Transportation and City Engineering (STCE 2023)

View full text Add to dashboard Cite

show abstract

“…From the perspective of systems engineering and operational optimization, some scholars have studied the basic theory of vehicle routing problems (VRP) (14,15) to optimize urban logistics. Meanwhile, there are others research variants of VRP, such as Capacity VRP (16), Two-echelon VRP (2E-VRP) (17,18), Green VRP (19,20), VRPTW (21), and so on. As mentioned above, each study applies one or more optimization algorithm, aiming to reduce the delivery cost and improve efficiency.…”

Section: Literature Reviewmentioning

confidence: 99%

Matching Model for Multiple Delivery Methods in Last-Mile Delivery for Online Shopping

Wang

2021

Transportation Research Record: Journal of the Transportation R

View full text Add to dashboard Cite

Against the background of e-commerce, online shopping has seen considerable growth in China, as in the rest of the world. The last mile of delivery services for online shopping is a logistics challenge that affects service performance. This study has two main aims: first, to construct an evaluation criteria system for last-mile delivery service; and second to propose a matching model, capable of ranking six delivery methods according to customer preferences in the different urban areas. The factors base is established from the literature and from questionnaires and interviews with experts. Moreover, by conducting a questionnaire with consumers and analyzing the data, this research identifies the top 15 factors. The matching model based on the fuzzy analytic hierarchy process is constructed to compute the weight of each factor. The collection of data on customer preference was performed in distinct urban areas. Finally, to illustrate the validity of the criteria factors and the matching model, it was applied to three districts in Chongqing in China. Finally, our theoretical results from the experiments in real-life instances show that the criteria system and the matching model could help express companies to identify appropriate delivery methods in specific areas.

show abstract

“…We assume the manufacturer has a homogenous fleet, with vehicle capacity Q. Each vehicle can be used iteratively, performing a new trip after the previous shipment is completed [13,40,47]. Let M = {1, …, m} represent shipments set for the manufacturer's fleet and q j represent units of fleet capacity needed to fulfill order j ∈ N by vehicle.…”

Section: Problem Definitionmentioning

confidence: 99%

Integrating production scheduling and transportation procurement through combinatorial auctions

Triki

Piya

2020

Networks

View full text Add to dashboard Cite

This study uses the winner determination problem (WDP) to integrate auction transportation procurement with decisions related to production scheduling. The basic problem arises when a manufacturer has to clear a combinatorial auction to decide whether to cover transportation needs by using the in‐house fleet or to procure transportation through auction. Thus, the manufacturer should include an additional decision level by integrating the WDP with production scheduling to gain efficiency and achieve savings in the logistics system. To the best of our knowledge, this is the first time production and transportation procurement problems are being solved simultaneously in an integrated manner. The study proposes a mathematical formulation and develops two heuristic approaches for solving the integrated problem. Extensive computational experiments and sensitivity analyses are reported to validate the model, assess the performance of the heuristics, and show the effect of integration on total cost.

show abstract

New compact integer programming formulations for the multi-trip vehicle routing problem with time windows

Cited by 33 publications

References 21 publications

Review of research on vehicle routing problems

Review of research on vehicle routing problems

Matching Model for Multiple Delivery Methods in Last-Mile Delivery for Online Shopping

Integrating production scheduling and transportation procurement through combinatorial auctions

Contact Info

Product

Resources

About