On the formulation and solution of the convoy routing problem

Goldstein, Darin; Shehab, Tariq; Casse, Juan I.; Lin, Hsiu-Chin

doi:10.1016/j.tre.2009.04.003

Cited by 11 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They pointed out that incorporating start time delays for journeys provides a scope for improving the 'quality' of routes. Chardaire et al (2001), Thangarajoo et al (2008), Ram Kumar and Narendran (2008) and Goldstein et al (2010) adapted the developed framework of the CMP by Lee et al (1996). Ram and Gopalan and Narayanaswamy (2009) further addressed several additional real-life considerations in the models.…”

Section: Literature Reviewmentioning

confidence: 99%

New approaches for solving the convoy movement problem

Mokhtar

Krishnamoorthy

Dayama

et al. 2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

New approaches for solving the convoy movement problem

Mokhtar

Krishnamoorthy

Dayama

et al. 2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

“…travel in platoon) as [5] [6] [7], while others put the points on the optimization problem of shortest path as [8] [9] [15].…”

Section: Related Workmentioning

confidence: 99%

A Distributed Intelligent System for Emergency Convoy

Benalla¹,

Achchab²,

Hrimech³

2016

IJIMAI

View full text Add to dashboard Cite

-The general problem that guides this research is the ability to design a distributed intelligent system for guiding the emergency convoys; a solution that will be based on a group of agents and on the analysis of traffic in order to generate collective functional response. It fits into the broader issue of Distributed Artificial System (DAI), which is to operate a cooperatively computer agent into multi-agents system (MAS). This article describes conceptually two fundamental questions of emergency convoys. The first question is dedicated to find a response to the traffic situation (i.e. fluid way), while the second is devoted to the convoy orientation; while putting the point on the distributed and cooperative resolution for the general problem.

show abstract

“…Ram Kumar and Narendran (2008, 2009, Ram consider a number of CMP instances related to military logistics. Computational procedures for the CMP are also provided by Goldstein et al (2010) and Thangarajoo et al (2008). Kolesar et al (2012) consider a closely related problem, the optimal clearing of explosive devices in order to safeguard the movement of convoys.…”

Section: Cmps and Military Logisticsmentioning

confidence: 99%

Computational complexity of convoy movement planning problems

Gopalan

2015

Math Meth Oper Res

View full text Add to dashboard Cite

Convoy movement planning problems arise in a number of important logistical contexts, including military planning, railroad optimization and automated guided vehicle routing. In the convoy movement problem (CMP), a set of convoys, with specified origins and destinations, are to be routed with the objective of minimizing either makespan or total flow time, while observing a number of side constraints. This paper characterizes the computational complexity of several restricted classes of CMPs. The principal objective is to identify the most parsimonious set of problem features that make the CMP intractable. A polynomial-time algorithm is provided for the single criterion two-convoy movement problem. The performance of a simple prioritizationidling approximation algorithm is also analyzed for the K-convoy movement problem. Error bounds are developed for the makespan and flow time objectives.

show abstract

On the formulation and solution of the convoy routing problem

Cited by 11 publications

References 13 publications

New approaches for solving the convoy movement problem

New approaches for solving the convoy movement problem

A Distributed Intelligent System for Emergency Convoy

Computational complexity of convoy movement planning problems

Contact Info

Product

Resources

About