A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Zou, Han; Dessouky, Maged

doi:10.1007/s41604-018-0006-5

Cited by 12 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, the dynamic stochastic VRP benefits from the problem's prior knowledge. Three strategies, including stochastic modelling [29], sampling method and look-ahead dynamic routing [30] were mainly used in the literature.…”

Section: Related Work and Motivationmentioning

confidence: 99%

Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems

Minku

Menzel

et al. 2020

Parallel Problem Solving From Nature – PPSN XVI

View full text Add to dashboard Cite

The capacitated arc routing problem (CARP) is a challenging combinatorial optimisation problem abstracted from typical real-world applications, like waste collection and mail delivery. However, few studies considered dynamic changes during the vehicles' service, which can make the original schedule infeasible or obsolete. The few existing studies are limited by dynamic scenarios that can suffer single types of dynamic events, and by algorithms that rely on special operators or representations, being unable to benefit from the wealth of contributions provided by the static CARP literature. Here, we provide the first mathematical formulation for dynamic CARP (DCARP) and design a simulation system to execute the CARP solutions and generate DCARP instances with several common dynamic events. We then propose a novel framework able to generalise all existing static CARP optimisation algorithms so that they can cope with DCARP instances. The framework has the option to enhance optimisation performance for DCARP instances based on a restart strategy that makes no use of past history, and a sequence transfer strategy that benefits from past optimisation experience. Empirical studies are conducted on a wide range of DCARP instances. The results highlight the need for tackling dynamic changes and show that the proposed framework significantly improves over existing algorithms.

show abstract

Section: Related Work and Motivationmentioning

confidence: 99%

Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems

Minku

Menzel

et al. 2020

Parallel Problem Solving From Nature – PPSN XVI

View full text Add to dashboard Cite

show abstract

“…The reported results showed that AHGA with waiting strategies significantly outperformed other heuristic approaches. Zou and Dessouky (2018) addressed the DVRPTWSC aiming to minimize the total travel distance. The authors developed an optimization-based look-ahead dynamic routing framework.…”

Section: The Dynamic Vehicle Routing Problem With Time Windows and Stmentioning

confidence: 99%

A cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers

Coral¹

View full text Add to dashboard Cite

show abstract

A column generation approach for the lexicographic optimization of intra-hospital transports

Bärmann,

Martin,

Müller

et al. 2024

OR Spectrum

View full text Add to dashboard Cite

Over the last few years, the efficient design of processes in hospitals and medical facilities has received more and more attention, particularly when the improvement of the processes is aimed at relieving the workload of medical staff. To this end, we have developed a method to determine optimal allocations of intra-hospital transports to hospital transport employees. When optimizing transport plans in hospitals, there are various optimization goals to strive for. Therefore, we used a lexicographic approach to solve this multi-criteria optimization problem. To calculate optimal transport plans in a sufficiently short computation time, we have decomposed the problem at hand with the Dantzig–Wolfe reformulation and solved the resulting pricing subproblem with an enumerative column generation approach. To improve the efficiency of the column generation process, we have investigated and implemented different pruning methods, dominance rules and a column reuse mechanism for the online setting of the application at hand. In an extensive computational study, we first evaluated the efficiency of the different pruning methods before we compared our solution approach with the standard branch-and-bound column search approach, classical column generation methods and the solution of an integrated MIP model solved by a commercial solver. Finally, we present performance indicators of the transport optimization tool, which was developed from our method and is now productively used in a German hospital.

show abstract

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Cited by 12 publications

References 32 publications

Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems

Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems

A cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers

A column generation approach for the lexicographic optimization of intra-hospital transports

Contact Info

Product

Resources

About