A case study of consistent vehicle routing problem with time windows

Lespay, Hernán; Suchan, Karol

doi:10.1111/itor.12885

Cited by 7 publications

(8 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the algorithm for minimizing the number of vehicles in ConVRPTW proposed in [11], we develop an algorithm for reducing the number of territories for TD-DMPVRPTW. The proposed algorithm consists of two main heuristics: the Territory Elimination Heuristic and the Merge Heuristic.…”

Section: Solution Frameworkmentioning

confidence: 99%

“…A feasible merge of the basic unit v in with a territory k corresponds to a set of feasible insertions of v in into the route r k,d , for each day d when v in has a positive demand. For each day, the best insertion position is computed as in [11]. If there exist feasible insertions, then the one with the lowest cost is chosen.…”

Section: 2mentioning

confidence: 99%

“…All of the classes consider 100 customers and a single depot. From Solomon's instances, we construct small TD-DMPVRPTW instances, as in [11]. We consider only the first ten customers and keep without modifying the customers' demands, coordinates, time windows, and service times.…”

Section: 11mentioning

confidence: 99%

“…Most parameters of the algorithm were set the same as the values used in [11], with the maximum computational time CT max = {1, 10, 60}, in minutes, and k max = 3. Additionally, we chose values for η, p max , F .…”

Section: 11mentioning

confidence: 99%

“…In particular, we set η = 5, p max = 5, and F = 10. Other parameter settings of the algorithm are available in [11].…”

Section: 11mentioning

confidence: 99%

See 4 more Smart Citations

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows

Lespay,

Suchan

2020

Preprint

Self Cite

View full text Add to dashboard Cite

This study introduces the Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows (TD-DMPVRPTW), motivated by a real-world application at a food company's distribution center. This problem deals with the design of contiguous and compact territories for delivery of orders from a depot to a set of customers, with time windows, over a multi-period planning horizon. Customers and their demands vary dynamically over time. The problem is modeled as a mixed-integer linear program (MILP) and solved by a proposed heuristic. The heuristic solutions are compared with the proposed MILP solutions on a set of small artificial instances and the food company's solutions on a set of real-world instances. Computational results show that the proposed algorithm can yield high-quality solutions within moderate running times.

show abstract

Section: Solution Frameworkmentioning

confidence: 99%

Section: 2mentioning

confidence: 99%

Section: 11mentioning

confidence: 99%

Section: 11mentioning

confidence: 99%

“…In particular, we set η = 5, p max = 5, and F = 10. Other parameter settings of the algorithm are available in [11].…”

Section: 11mentioning

confidence: 99%

See 3 more Smart Citations

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows

Lespay,

Suchan

2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

The consistent production routing problem

2022

View full text Add to dashboard Cite

This article introduces the consistent production routing problem in a setting with multiple plants and products. The problem consists in finding minimum‐cost production‐routing plans that also meet specific consistency requirements. In our context, consistency is defined as the degree to which some specified features of the solution remain invariant over time. We consider four forms of consistency, namely: driver, source, product, and plant consistency. For each of these consistency requirements, there is a target maximum value defining the decision‐maker's tolerance to deviations from a perfectly consistent solution. These targets are enforced as soft constraints whose violations need to be minimized when optimizing the integrated production and routing plan. We present a mathematical formulation for the problem and an exact branch‐and‐cut algorithm, enhanced with valid inequalities and specific branching priorities. We also propose a heuristic solution method based on iterated local search and several mathematical programming components. Experiments on a large benchmark set of newly introduced instances show that the enhancements substantially improve the performance of the exact algorithm and that the heuristic method performs robustly for production routing problems with different consistency requirements as well as for standard versions of the problem. We also analyze the cost‐consistency trade‐off of the solutions, confirming that it is possible to impose consistency without excessively increasing the cost. The results also reveal the impact of the first time period when optimizing and measuring the consistency features we study.

show abstract

Standardized validation of vehicle routing algorithms

Jastrzab,

Myller,

Tulczyjew

et al. 2024

Appl Intell

View full text Add to dashboard Cite

Designing routing schedules is a pivotal aspect of smart delivery systems. Therefore, the field has been blooming for decades, and numerous algorithms for this task have been proposed for various formulations of rich vehicle routing problems. There is, however, an important gap in the state of the art that concerns the lack of an established and widely-adopted approach toward thorough verification and validation of such algorithms in practical scenarios. We tackle this issue and propose a comprehensive validation approach that can shed more light on functional and non-functional abilities of the solvers. Additionally, we propose novel similarity metrics to measure the distance between the routing schedules that can be used in verifying the convergence abilities of randomized techniques. To reflect practical aspects of intelligent transportation systems, we introduce an algorithm for elaborating solvable benchmark instances for any vehicle routing formulation, alongside the set of quality metrics that help quantify the real-life characteristics of the delivery systems, such as their profitability. The experiments prove the flexibility of our approach through utilizing it to the NP-hard pickup and delivery problem with time windows, and present the qualitative, quantitative, and statistical analysis scenarios which help understand the capabilities of the investigated techniques. We believe that our efforts will be a step toward the more critical and consistent evaluation of emerging vehicle routing (and other) solvers, and will allow the community to easier confront them, thus ultimately focus on the most promising research avenues that are determined in the quantifiable and traceable manner.

show abstract

A case study of consistent vehicle routing problem with time windows

Cited by 7 publications

References 28 publications

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows

The consistent production routing problem

Standardized validation of vehicle routing algorithms

Contact Info

Product

Resources

About