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

Tellez, Oscar; Vercraene, Samuel; Lehuédé, Fabien; Péton, Olivier; Monteiro, Thibaud

doi:10.1016/j.trc.2018.03.020

Cited by 38 publications

(55 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, it was shown not to have any added value in [127], and the authors therefore decided to refrain from using it, and rather choose the heuristics randomly according to a uniform distribution. Similarly, the adaptive layer was removed in [34,68,94,123], since extensive tests showed that no (signi cant) advantage could be identi ed when employing the adaptive mechanism. A complete removal of the adaptive layer was shown to exhibit only a very slight deterioration of results in [28]: with a careful o ine heuristic selection, the adaptive mechanism did not need to be implemented to further guide the heuristic selection online.…”

Section: Justification For Reviewmentioning

confidence: 99%

“…A few contacted authors suggested including results also for additional articles (not identi ed with Google Scholar, or with no ALNS in the title: [59,107,108,110,123]), which we decided to consider in order to have as many potential studies as possible. These studies therefore did not need to satisfy our eligibility criteria, since the researchers were already clear on precisely what type of information was needed.…”

Section: Identification Selection and Main Properties Of Studiesmentioning

confidence: 99%

“…• Objective function -The particular formulation of the objective function can have an in uence on the importance of adaptiveness. For example, in some of the studies [23,123] included in the analysis, the objective function includes some xed costs, which can be large. If the objective function corresponds to, e.g., total routing costs, and two algorithms return solutions with with the cost of 100 and 90, the latter algorithm improves over the former by 10%.…”

Section: Identification Selection and Main Properties Of Studiesmentioning

confidence: 99%

See 2 more Smart Citations

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Turkeš

Sörensen

Hvattum

2021

European Journal of Operational Research

View full text Add to dashboard Cite

Research on metaheuristics has focused almost exclusively on (novel) algorithmic development and on competitive testing, both of which have been frequently argued to yield very little generalizable knowledge. The main goal of this paper is to promote meta-analysis-a systematic statistical examination that combines the results of several independent studies-as a more suitable way to obtain problem-and implementation-independent insights on metaheuristics. Meta-analysis is widely used in several scienti c domains, most notably the medical sciences (e.g., to establish the e cacy of a certain treatment). To the best of our knowledge this is the rst meta-analysis in the eld of metaheuristics.

show abstract

Section: Justification For Reviewmentioning

confidence: 99%

Section: Identification Selection and Main Properties Of Studiesmentioning

confidence: 99%

Section: Identification Selection and Main Properties Of Studiesmentioning

confidence: 99%

See 1 more Smart Citation

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Turkeš

Sörensen

Hvattum

2021

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Unlike in VRP and PDP, the passenger convenience must be considered in DARP. Various versions of DARP were also proposed, such as the Integrated Dial-a-Ride Problem (IDARP) [17], [18], Fleet Size and Mix DARP with Reconfigurable vehicle Capacity (FSM-DARP-RC) [19]. Usually, Algorithms designed for DARP are more complex than those for VRP and PDP [17], [20], [21], due to their extra constraints imposed by passenger transport, e.g., the paired visiting places and the time window constraints of serving passengers.…”

Section: Introductionmentioning

confidence: 99%

Compatibility-Based Approach for Routing and Scheduling the Demand Responsive Connector

2020

IEEE Access

View full text Add to dashboard Cite

This study concentrates on the routing and scheduling problem of Demand Responsive Connector to build feeder plans for people traveling from and to transit hub. An in-depth analysis on the characteristics of feeder services was implemented to inspire the compatibility-based algorithm design. With the goal of reducing operating cost and passenger inconvenience, the proposed algorithm took several factors critical to the real-word operation into consideration, such as double time window assurance (the time constraints at the beginning and end of passenger travels), the flexibility of feeder plans, and the number of vehicles. Our method was validated on numerical instances of 400, 600, 800 and 1000 passengers. Simulation results show that the compatibility-based algorithm can effectively reduce the number of vehicles with acceptable increase of passengers' inconvenience, and can improve the algorithm efficiency considerably. In addition, the setting of flexible time window of shutter plan can hold some elasticity for feeder services. Sensitivity analysis was conducted to help service providers evaluate the trade-off between the operation cost and level of service. INDEX TERMS Compatibility-based approach, demand responsive connector, routing and scheduling.

show abstract

“…In fact, our problem is also similar to some routing and scheduling problems in the domain of transportation, such as cash transportation vehicle routing and scheduling problem [28,29], first and last mile delivery problem [30][31][32], waste collection routing problem [33][34][35] and dial-a-ride problem [36,37]. Considering the locations of customers and some specific constraints (e.g., time windows and vehicle capacity), the solution approaches to these problems cannot be applied to our problem directly.…”

Section: Introductionmentioning

confidence: 99%

A Multi-Objective Programming Approach to Design Feeder Bus Route for High-Speed Rail Stations

Guo¹,

Song²,

He³

et al. 2019

Symmetry

View full text Add to dashboard Cite

The quality of route design can greatly affect the operational efficiency of feeder bus service for high-speed rail stations. A bi-objective optimization formulation is established to consider the trade-off between two conflicting optimization objectives, namely maximizing the travel demand that can be served and minimizing the feeder bus route length. The Pareto optimal solutions of the discrete mathematical formulation are generated by the exact ε-constraint method. We test the proposed approach with a numerical example on an actual size scale. The results indicate that the computational efficiency of the solution approach is encouraging, and a series of route design plans and location stop plans are generated simultaneously in a short time. A numerical example also shows that as the passengers’ maximum acceptable walking distance increases, more travel demand can be served when the route length does not change much. Benefits brought by increasing feeder bus route length are analyzed and the robustness of obtained solutions is verified. The comparison of our approach and an existing approach is also presented to demonstrate that our approach can generate better solutions.

show abstract

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

Cited by 38 publications

References 38 publications

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Compatibility-Based Approach for Routing and Scheduling the Demand Responsive Connector

A Multi-Objective Programming Approach to Design Feeder Bus Route for High-Speed Rail Stations

Contact Info

Product

Resources

About