Heuristics for the bi-objective path dissimilarity problem

DOI10.1016/j.cor.2009.01.003zbMath1162.90594OpenAlexW2042637796MaRDI QIDQ1025234

Abraham Duarte, Rafael Martí, José Luis González-Velarde

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.003

zbMATH Keywords

metaheuristicsroutingbi-objective programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network, Multiobjective GRASP with path relinking, Hazardous material transportation problems: a comprehensive overview of models and solution approaches, The \(k\)-dissimilar vehicle routing problem, Multiple-path selection for new highway alignments using discrete algorithms, Generalized route planning model for hazardous material transportation with VaR and equity considerations, A simulated annealing for multi-criteria network path problems, A concise guide to existing and emerging vehicle routing problem variants, Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations, Solving the edge‐disjoint paths problem using a two‐stage method, Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem, A relation of dominance for the bicriterion bus routing problem, Objectives and methods in multi-objective routing problems: a survey and classification scheme

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• On finding dissimilar Pareto-optimal paths
• On a multicriteria shortest path problem
• Finding minimum and equitable risk routes for hazmat shipments
• Tabu search and GRASP for the maximum diversity problem
• The discrete p-dispersion problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A bicriterion shortest path algorithm
• Greedy randomized adaptive search procedures
• On finding dissimilar paths
• Heuristic algorithms for the maximum diversity problem