A note on “Efficient feasibility testing for dial-a-ride problems”

Tang, Jiafu; Kong, Yuan; Lau, Henry C. W.; Ip, W. H.

doi:10.1016/j.orl.2010.05.002

Cited by 28 publications

(31 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several efficient algorithms have thus been designed to satisfy the most common DARP constraints with the best possible complexity (see e.g. Hunsaker and Savelsbergh (2002); Tang et al (2010); Firat and Woeginger (2011);Gschwind, Timo (2015)). The latest contribution in this area is Gschwind and Drexl (2016), which proposes an incremental algorithm to evaluate, in constant time, the feasibility of request insertions in routes.…”

Section: The Dial-a-ride Problemmentioning

confidence: 99%

See 1 more Smart Citation

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

Tellez

Vercraene

Lehuédé

et al. 2018

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

Section: The Dial-a-ride Problemmentioning

confidence: 99%

“…It is based on Tang et al (2010) as presented in Gschwind, Timo (2015). We add forward time slack calculations from Cordeau and Laporte (2003) in order to determine the minimum route duration.…”

Section: Schedule Evaluationmentioning

confidence: 99%

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

Tellez

Vercraene

Lehuédé

et al. 2018

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

“…The first one refers to costs minimisation (Louis et al, 1999). The second refers to the profit (profit or reward) maximisation (Tang et al, 2010). In essence, these constitute the same methodology, given that inverting cost coefficients the problem is converted from cost minimisation to profit maximisation.…”

Section: Cost Parameters For the Participation Of A Node In A Routementioning

confidence: 99%

A heuristic algorithm searching optimum routes for maritime transportation

Chainas

2016

IJCCIA

View full text Add to dashboard Cite

Abstract:The present essay presents a heuristic algorithm for the optimisation of coastal vessel's routes. The task is to research the optimum connection between two ports, incorporating in their routes intermediate nodes, which must satisfy certain limitations and some preconditions related to total distance, trip duration, and demand coverage. This issue has many common elements with the overall vehicle routing problem and the team orienteering problem, but, at the same time, presents with significant particularities. Its particularities consist mainly in the fact that in the sea area, each node may be theoretically linked to any other node, without limitations, while a road network has a specific structure. The results of the algorithm implementation for its region of application were improved compared to that in the literature. The advantages of its application by the maritime companies for the search of the optimal itineraries will be important mainly in terms of resource saving.Keywords: optimisation; maritime; network; heuristic; algorithm; search.Reference to this paper should be made as follows: Chainas, K. (2016) 'A heuristic algorithm searching optimum routes for maritime transportation', Int.

show abstract

“…In some specific cases it fails to find a feasible solution although such a solution exists. This problem has been described in Högberg (2008), Tang et al (2010) and Haugland and Ho (2010). If the algorithm finds a feasible solution, then indeed the solution is feasible, but for some cases it can state that no feasible solution exists in situations when this is not true.…”

Section: If No Feasible Insertion Exists Add the Request To A List Omentioning

confidence: 99%

A modeling system for simulation of dial-a-ride services

Häll

Högberg²,

Lundgren

2012

Public Transp

View full text Add to dashboard Cite

We present a modeling system for simulation of dial-a-ride services. It can be used as a tool for understanding and study how different designs, and different ways to operate a dial-a-ride service, affect the performance and efficiency of the service. The system simulates the operation of a dynamic dial-a-ride service that operates with multiple fleets of vehicles with different capacities, schedules and depots. It can be used to investigate how the setting of service and cost parameters and the design of the service affect the total cost for the operator and level of service for the customer. We describe the different modules in the system and the possible uses of the system. A short simulation study is performed to exemplify how it can be used. In this study the effects of including costs for customer discomfort are evaluated.

show abstract

A note on “Efficient feasibility testing for dial-a-ride problems”

Cited by 28 publications

References 1 publication

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

A heuristic algorithm searching optimum routes for maritime transportation

A modeling system for simulation of dial-a-ride services

Contact Info

Product

Resources

About