Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing
Lecture notes in computer sciencePublished 1 January 2011
Wesam Herbawi, Michael Weber
Citations53
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work presents an evolutionary multiobjective route planning algorithm for solving the route planning problem in the dynamic multi-hop ridesharing and indicates that the evolutionary approach is able to provide a good quality set of route plans and outperforms the generalized label correcting algorithm in term of runtime.
Abstract
Ridesharing is considered as one of the promising solutions for dropping the consumption of fuel and reducing the congestion in urban cities, hence reducing the environmental pollution. In this work, we present an evolutionary multiobjective route planning algorithm for solving the route planning problem in the dynamic multi-hop ridesharing. The experiments indicate that the evolutionary approach is able to provide a good quality set of route plans and outperforms the generalized label correcting algorithm in term of runtime.
Keywords
Computer ScienceEngineering
IEEE Transactions on Evolutionary ComputationA fast and elitist multiobjective genetic algorithm: NSGA-II
47,759 Citations2002Kalyanmoy Deb, Amrit Pratap +2 more
This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
IEEE Transactions on Evolutionary ComputationPerformance assessment of multiobjective optimizers: an analysis and review
4,220 Citations2003Eckart Zitzler, Lothar Thiele +3 more
Geophysical Research LettersNorthern hemisphere temperatures during the past millennium: Inferences, uncertainties, and limitations
1,870 Citations1999Michael Mann, Raymond S. Bradley +1 more
Evolutionary multi-criterion optimization
1,107 Citations2010Kalyanmoy Deb
This lecture shall present a few popular and state-of-the-art algorithms, demonstrate their advantages on a number of real-world practical problems from engineering and society, and introduce some recent research topics.
Advanced information and knowledge processingEvolutionary Multiobjective Optimization
374 Citations2005Ajith Abraham, Lakhmi C. Jain
In this introductory chapter, some fundamental concepts of multiobjective optimization are introduced, emphasizing the motivation and advantages of using evolutionary algorithms.
The jMetal framework for multi-objective optimization: Design and architecture
285 Citations2010Juan J. Durillo, Antonio J. Nebro +1 more
The design issues underlying jMetal are described, focusing mainly on its internal architecture, with the aim of offering a comprehensive view of its main features to interested researchers.
Computers & Operations ResearchA label correcting approach for solving bicriterion shortest-path problems
194 Citations2000Anders J.V. Skriver, Kim Allan Andersen
A very fast algorithm for solving the bicriterion shortest-path problem is contributed with some simple domination conditions, and the number of iterations needed to find all the efficient (Pareto optimal) paths in the network is reduced.
ACM Journal of Experimental AlgorithmicsDijkstra's algorithm on-line
172 Citations2000Frank Schulz, Dorothea Wagner +1 more
This study considers the scenario of a central information server in the realm of public railroad transport on wide-area networks, based on the timetable data of all German trains and on a "snapshot" of half a million customer queries for Dijkstra's algorithm.
European Journal of Operational ResearchAn empirical investigation of some bicriterion shortest path algorithms
135 Citations1989James Perry Brumbaugh-Smith, Douglas R. Shier
In this paper, several implementations of a general label correcting algorithm are discussed for bicriterion networks and their implementations are compared on networks of varying size and having varying degrees of correlation between the two criteria.
Transportation Research Part D Transport and EnvironmentFuel saving and ridesharing in the US: Motivations, limitations, and opportunities
121 Citations2008Sheldon H. Jacobson, Douglas M. King
Lecture notes in computer sciencePareto Shortest Paths is Often Feasible in Practice
77 Citations2001Matthias Müller‐Hannemann, Karsten Weihe
Certain key characteristics of Pareto optima occur in various applications and are evaluated on a concrete application scenario and on a simplified randomized model, in which these characteristics occur in a very purist form.
Lecture notes in computer scienceFastPGA: A Dynamic Population Sizing Approach for Solving Expensive Multiobjective Optimization Problems
64 Citations2007Hamidreza Eskandari, Christopher D. Geiger +1 more
Computational results for a number of well-known test problems indicate that FastPGA is a promising approach, and it outperforms the improved nondominated sorting genetic algorithm (NSGA-II) within a relatively small number of solution evaluations.
Lecture notes in computer scienceDijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
60 Citations1999Frank Schulz, Dorothea Wagner +1 more
International Journal of Geographical Information SystemsAn evolutionary algorithm for multicriteria path optimization problems
58 Citations2006Peter Mooney, Adam C. Winstanley
The Evolutionary Algorithm approach to MSPPs on networks with multiple independent criteria is shown to sufficiently explore the underlying network space, generate large candidate path sets, and evolve high quality approximations to the optimal MSPP solution(s).