activity
20212023
most citedSolving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests

73 citations · 76 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2023★ 1 cited

Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem

Sifa Celik, Layla Martin, Albert H. Schrotenboer +1

Next-day delivery logistics services are redefining the industry by increasingly focusing on customer service. A challenge each logistics service provider faces is to jointly optim…

math.OC2022

A Branch-and-Price Algorithm for the Two-Echelon Inventory-Routing Problem

Sara Charaf, Duygu Taş, Simme Douwe Flapper +1

The two-echelon inventory-routing problem (2E-IRP) addresses the coordination of inventory management and freight transportation throughout a two-echelon supply network. The latter…

math.OC2022★ 73 cited

Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests

Jian Zhang, Kelin Luo, Alexandre M. Florio +1

Dynamic vehicle routing problems (DVRPs) arise in several applications such as technician routing, meal delivery, and parcel shipping. We consider the DVRP with stochastic customer…

math.OC2021

Spot Market versus Full Charter Fleet: Decisions Support for Full Truck Load Tenders

Veaceslav Ghilas, Ivo Hedtke, Joachim Weise +1

This paper presents an approach to help business decision-makers gain market share by providing competitive tender offers for Full-Truck-Load (FTL) services. In particular, we comp…

math.OC2021★ 2 cited

Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem

David Lai, Yijun Li, Emrah Demir +2

The Capacitated Lot-Sizing Problem (CLSP) and its variants are important and challenging optimization problems. Constructive heuristics are known to be the most intuitive and faste…