Customer-Oriented Dial-A-Ride Problems: A Survey on Relevant Variants, Solution Approaches and Applications

Nasri, Sonia; Bouziri, Hend

doi:10.1007/978-3-030-53440-0_13

Cited by 9 publications

(4 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The US Army Aviation air movement operations planning problem is closely related to the dial-a-ride problem (DARP) as described in Cordeau and Laporte (2007) and most recently surveyed in Ho et al (2018a) and Nasri et al (2021). DARP consists of creating m vehicle routes for n customers with pickup and delivery requests between origins and destinations, where n > m. The objective is to plan a set of m minimum cost vehicle routes while supporting as many customers as possible, under a set of constraints.…”

Section: Literature Reviewmentioning

confidence: 99%

US Army Aviation air movement operations assignment, utilization and routing

Nelson

King

McConnell

et al. 2023

JDAL

View full text Add to dashboard Cite

PurposeThe purpose of this study was to create an air movement operations planning model to rapidly generate air mission request (AMR) assignment and routing courses of action (COA) in order to minimize unsupported AMRs, aircraft utilization and routing cost.Design/methodology/approachIn this paper, the US Army Aviation air movement operations planning problem is modeled as a mixed integer linear program (MILP) as an extension of the dial-a-ride problem (DARP). The paper also introduces a heuristic as an extension of a single-vehicle DARP demand insertion algorithm to generate feasible solutions in a tactically useful time period.FindingsThe MILP model generates optimal solutions for small problems (low numbers of AMRs and small helicopter fleets). The heuristic generates near-optimal feasible solutions for problems of various sizes (up to 100 AMRs and 10 helicopter team fleet size) in near real time.Research limitations/implicationsDue to the inability of the MILP to produce optimal solutions for mid- and large-sized problems, this research is limited in commenting on the heuristic solution quality beyond the numerical experimentation. Additionally, the authors make several simplifying assumptions to generalize the average performance and capabilities of aircraft throughout a flight.Originality/valueThis research is the first to solve the US Army Aviation air movement operations planning problem via a single formulation that incorporates multiple refuel nodes, minimization of unsupported demand by priority level, demand time windows, aircraft team utilization penalties, aircraft team time windows and maximum duration and passenger ride time limits.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

US Army Aviation air movement operations assignment, utilization and routing

Nelson

King

McConnell

et al. 2023

JDAL

View full text Add to dashboard Cite

show abstract

“…Authors in [3] reviewed various categories of real-life DARP features related to heterogeneity [22,23], routing properties [8,13], and quality specifications. In this field of quality specifications, the authors in [24] proposed a deeper survey on models being used by advanced research studies involving service quality designs from the customer's point of view. These researches are in relation to maximal riding time (eg.…”

Section: Literature Reviewmentioning

confidence: 99%

A new hybrid evolutionary search for transport on-demand optimization

Nasri

Bouziri²

2023

Preprint

Self Cite

View full text Add to dashboard Cite

Today, there is a growing need for advancements that can enhance transport accessibility. As customers’ expectations rise, on-demand transport services must cater to higher requirements. Consequently, this study addresses a specific problem belonging to the class of Dial-A-Ride Problems, which incorporates constraints focused on meeting customers’ needs. To address this problem, we propose a novel hybrid evolutionary search method. This method combines the strengths of a Tabu Search approach with an evolutionary schema, resulting in a more effective solution. Additionally, we introduce two exchanged mutation operators and a crossover mechanism as part of the proposed method. These optimization techniques have been proven to support advanced designs and significantly reduce operational costs while improving service quality. A comparative analysis with an evolutionary local search method from the existing literature has demonstrated the effectiveness of our approach. With this approach, service providers can optimize their operations, reduce costs, and provide a higher level of service quality, ensuring satisfaction from both the service provider and customer perspectives.

show abstract

“…This is what is highlighted in [4], fostering the modelling of mobility-on-demand problems according to a customer-oriented design. This issue is thoroughly studied in the survey of [20] which gathers two main fields of research related to the quality of service levels in DARPs. In the first group of works, the DARP is qualified as classical when it aims at minimizing the travel costs ensuring a common design of the service quality for all the users, (e.g., [5,[21][22][23][24]).…”

Section: The Dial-a-ride Problem With a Customized Design Of The Serv...mentioning

confidence: 99%

“…This constant is generally fixed as 1000, see the work of [1,42], which used this value successfully for the linearization of their problem constraints. Moreover, Equation (20) ensures that the binary nature of the decision variables x v (i,j) is respected. Finally, inequality (21) impose the positivity of the scheduling decision variables.…”

Section: Mathematical Formulation Of the Customer-oriented Darpmentioning

confidence: 99%

An Evolutionary Descent Algorithm for Customer-Oriented Mobility-On-Demand Problems

Nasri

Bouziri

2022

Sustainability

Self Cite

View full text Add to dashboard Cite

This paper is addressing a new class of on-demand transport problems oriented toward customers. A mixed-integer linear programming model is proposed with new effective constraints that contribute to enhancing the quality of service. An exact resolution has been achieved, leading to lower bounds of the solution space of real cases of on-demand transport problems. To overcome the exponential computational time of the exact resolution, an evolutionary descent method is developed. It relies on a new operator for perturbing the search. The comparative results between the new method and the branch and bound show low gaps for almost all the instances tested with lower execution times. The results of the evolutionary descent method are also compared with the results of two different heuristics, namely a Tabu Search and an Evolutionary Local Search. Our evolutionary method demonstrates its effectiveness through competitive and promising results.

show abstract

Customer-Oriented Dial-A-Ride Problems: A Survey on Relevant Variants, Solution Approaches and Applications

Cited by 9 publications

References 45 publications

US Army Aviation air movement operations assignment, utilization and routing

US Army Aviation air movement operations assignment, utilization and routing

A new hybrid evolutionary search for transport on-demand optimization

An Evolutionary Descent Algorithm for Customer-Oriented Mobility-On-Demand Problems

Contact Info

Product

Resources

About