Dynamic transport scheduling under multiple resource constraints

Ebben, Mark; Heijden, Matthijs C. van der; Harten, Aart van

doi:10.1016/j.ejor.2004.03.020

Cited by 22 publications

(17 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is solved with a constraint solver. Ebben et al [10] present a dedicated serial scheduling method to solve an automated guided vehicles scheduling problem, where docks for loading/unloading, vehicle parking places, and load storage space are limited. For more literature about synchronization constraints, we refer to [8].…”

Section: A Literature Reviewmentioning

confidence: 99%

“…We propose a heuristic based on [10] to insert requests in routes according to priority rules. This heuristic is similar to serial scheduling heuristic [14].…”

Section: B a Routing And Scheduling Heuristicmentioning

confidence: 99%

“…Constraints (9) ensure that it exists a request who first serves a demand. Two consecutive requests are linked by constraints (10). Constraints (11) and (12) enforce the continuous application of schedule demands and constraints (13) determine the schedule of unscheduled demands.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works

Grimault¹,

Lehuédé²,

Bostel³

2014

2014 International Conference on Logistics Operations Management

View full text Add to dashboard Cite

International audienceThis paper presents a two-phase method to solve a routing and scheduling problem that arises in public works. In this problem, the quantity of demands generally exceeds the capacity of a truck. As a result, demands have to be split into full truckloads, taking into account the various capacities in the heterogeneous fleet of vehicles that perform the transportation. Full truckload routes have to be designed and scheduled according to construction or loading constraints on pickup and delivery sites. In the first phase, we propose a linear program to split demands into full truckload requests. The second phase is a heuristic that solves a heterogeneous full truckload pickup and delivery problem with time windows and resource synchronization. The method is evaluated on instances from a real case study

show abstract

Section: A Literature Reviewmentioning

confidence: 99%

“…We propose a heuristic based on [10] to insert requests in routes according to priority rules. This heuristic is similar to serial scheduling heuristic [14].…”

Section: B a Routing And Scheduling Heuristicmentioning

confidence: 99%

See 1 more Smart Citation

A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works

Grimault¹,

Lehuédé²,

Bostel³

2014

2014 International Conference on Logistics Operations Management

View full text Add to dashboard Cite

show abstract

“…To this end, we use serial scheduling (Ebben et al, 2005), where different priority rules are being used to create a sequence of jobs, which are virtually assigned to vehicles. At the node level, we still decide on the assignment of jobs to vehicles.…”

Section: Traditional or Based Heuristics As Benchmarkmentioning

confidence: 99%

“…That is, a job should be assigned to a vehicle and a feasible start time should be determined. Because a fast response is required, we use local dispatch rules and serial scheduling as benchmarks, see (Van der Heijden, Ebben, Gademan and Van Harten, 2002) and (Ebben et al, 2005) for an extension of the serial scheduling method under capacity constraints. For the multi-agent system, we develop an auction mechanism with several pricing variants.…”

Section: Introductionmentioning

confidence: 99%

Sequential auctions for full truckload allocation

Mes¹

View full text Add to dashboard Cite

Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location

Sarasola

Doerner

2019

Networks

View full text Add to dashboard Cite

A vehicle routing problem with synchronization constraints arises in urban freight transportation, in which context customers require deliveries from one or more logistics service providers. These deliveries should be efficient to reduce idle times at the delivery locations. Idle time is defined as nonservice time between the first and the last delivery received by the customer. We propose a strategy which relies on self-imposed time windows, and we compare our approach with an exact determination of a feasible schedule and fixed time windows. The results show that idle times can be reduced by 54.12%-79.77%, with an average cost rise of 9.87%. In addition, self-imposed time windows provide solutions with 15.74%-21.43% lower costs than feasibility checks for short runtimes and 13.71%-21.15% lower than fixed time windows. KEYWORDSadaptive large neighborhood search, cooperation, metaheuristic, self-imposed time windows, synchronized transportation, vehicle routing problem This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Dynamic transport scheduling under multiple resource constraints

Cited by 22 publications

References 13 publications

A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works

A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works

Sequential auctions for full truckload allocation

Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location

Contact Info

Product

Resources

About