Optimal routing of a single vehicle with loading and unloading constraints

Ladany, Shaul P.; Mehrez, Abraham

doi:10.1080/03081068408717261

Cited by 33 publications

(24 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Øvstebø et al (2011) give a formulation for the TSP on roll-on/roll-off (RoRo) ships. Ladany and Mehrez (1984) make the first contribution to the TSPPD with LIFO constraints. The motivation for their study is a real-world delivery problem in which reshuffling of goods inside a container causes costs and time losses.…”

Section: Traveling Salesman Problem With Pickups and Deliveries With mentioning

confidence: 99%

See 1 more Smart Citation

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional packing constraints, unloading sequence constraints, stability constraints and axle weight limits. Ignoring these constraints impairs planning and induces last-minute changes resulting in additional costs. Developing vehicle routing models incorporating loading constraints is critical to more efficient route planning. The last couple of years has seen a huge increase of contributions to this field of research with almost 60 % of these being published after 2009. Our contribution is twofold. First, we overview the recent developments in the literature on all vehicle types in which loading constraints play a key role (trucks, airplanes, ships, and automated guided vehicles), using a state-of-the-art classification scheme to identify the loading constraints considered in each article. Second, we identify research gaps and opportunities for future research.

show abstract

Section: Traveling Salesman Problem With Pickups and Deliveries With mentioning

confidence: 99%

“…In the latter case, the loading constraints are usually incorporated in the vehicle routing problem (e.g., Cordeau et al 2010;Petersen and Madsen 2009;Cherkesly et al 2014a). Ladany and Mehrez (1984) x…”

Section: Integration Of Loading Constraints In Vehicle Routing Problemsmentioning

confidence: 99%

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, the first contribution on the TSPPDL is the one by Ladany and Mehrez (1984), who studied a real-world delivery problem arising in the transportation of milk containers. A similar problem was later investigated by Pacheco (1997), who proposed a heuristic algorithm based on classical TSP neighboring procedures.…”

Section: The Traveling Salesman Problem With Pickup and Delivery And mentioning

confidence: 99%

Routing problems with loading constraints

Iori

Martello

2010

TOP

187

103

View full text Add to dashboard Cite

We consider difficult combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them. The separate problems (routing and loading) are already NP-hard, and very difficult to solve in practice. A fortiori their combination is extremely challenging and stimulating. Although the specific literature is still quite limited, a first attempt to a systematic view of this field can be useful both to academic researchers and to practitioners. We review vehicle routing problems with twoand three-dimensional loading constraints. Other combinations of routing and special loading constraints arising from industrial applications are also considered

show abstract

“…To the best of our knowledge, the first mention of this problem was made by Ladany and Mehrez [18] who studied a reallife delivery problem in Israel. These authors have provided a description of the problem but no mathematical formulation.…”

Section: Introductionmentioning

confidence: 97%

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

et al. 2009

View full text Add to dashboard Cite

In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be picked up, and a destination location where the load must be delivered. The problem consists of determining a shortest Hamiltonian cycle through all locations while ensuring that the pickup of each request is performed before the corresponding delivery. This article addresses a variant of the TSPPD in which pickups and deliveries must be performed according to a Last-In First-Out (LIFO) policy. We propose three mathematical formulations for this problem and several families of valid inequalities which are used within a branch-and-cut algorithm. Computational results performed on test instances from the literature show that most instances with up to 17 requests can be solved in less than 10 min, whereas the largest instance solved contains 25 requests.

show abstract

Optimal routing of a single vehicle with loading and unloading constraints

Cited by 33 publications

References 6 publications

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Routing problems with loading constraints

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Contact Info

Product

Resources

About