Parallel VNS for Bus Terminal Location Problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Applied Soft Computing

• Publication date

  2016-05-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.asoc.2016.02.002
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Survey of Transportation Problems

  2014cited by this paper
• Memetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem

  2014cited by this paper
• A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem

  2014cited by this paper
• Two-phase optimization approach to transit hub location – the case of Dalian

  2013cited by this paper
• Variable Formulation Search for the Cutwidth Minimization Problem

  2013cited by this paper
• Review on Urban Transportation Network Design Problems

  2013cited by this paper
• Some heuristic methods for solving p-median problems with a coverage constraint

  2012cited by this paper
• comparative study between dynamic adapted PSO and VNS for the vehicle outing problem with dynamic requests

  2012cited by this paper
• An Efficient and Practically Robust Hybrid Metaheuristic Algorithm for Solving Fuzzy Bus Terminal Location Problems

  2012cited by this paper
• Covering problems in facility location: A review

  2012cited by this paper
• Pro .NET Performance

  2012cited by this paper
• Solving bus terminal location problems using evolutionary algorithms

  2011cited by this paper
• Transit Route Network Design Problem: Review

  2009cited by this paper
• Transit network design and scheduling: A global review

  2008cited by this paper
• A fast swap-based local search procedure for location problems

  2007cited by this paper
• The p-median problem: A survey of metaheuristic approaches

  2005cited by this paper
• Cooperative Parallel Variable Neighborhood Search for the p-Median

  2004cited by this paper
• The generalized maximal covering location problem

  2002cited by this paper
• The Parallel Variable Neighborhood Search for the p-Median Problem

  2002cited by this paper
• Operational objective functions in designing public transport routes

  2001cited by this paper
• Analysis of a local search heuristic for facility location problems

  2000cited by this paper
• Performance Measurement

  1999cited by this paper
• An efficient tabu search procedure for the p-Median Problem

  1997cited by this paper
• Variable neighborhood search for the p-median

  1997cited by this paper
• A Lagrangean heuristic for the maximal covering location problem

  1996cited by this paper
• Reserve selection as a maximal covering location problem

  1996cited by this paper
• Network and Discrete Location: Models, Algorithms, and Applications

  1995cited by this paper
• Genetic Local Search in Combinatorial Optimization

  1994cited by this paper
• Lagrangean heuristics for location problems

  1993cited by this paper
• TSPLIB - A Traveling Salesman Problem Library

  1991cited by this paper
• An overview of representative problems in location research

  1989cited by this paper
• Bus network design

  1986cited by this paper
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

  1983cited by this paper
• The maximal covering location problem

  1974cited by this paper
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

  1965cited by this paper

• A new model for facility bus terminal location problem based on modified Kerre’s inequality

  2025cites this paper
• A VNS-based approach for solving the Manhattan metric straddle carrier routing problem with buffer areas

  2024cites this paper
• A fuzzy multi-objective optimization model for sustainable location planning using volumetric fuzzy sets

  2023cites this paper
• Systematic Literature Review on Parallel Trajectory-based Metaheuristics

  2022influential citation
• A genetic algorithm integrated with the initial solution procedure and parameter tuning for capacitated P-median problem

  2022cites this paper
• Bi-level scheduling in high-end equipment R&D: when more algorithm strategies may not be better

  2022cites this paper
• Fusion of Inertial and Visual Sensor Data for Accurate Localization

  2021cites this paper
• A Weighted-Fused Localization Method Based on Zupt and Global Features of Images

  2021cites this paper
• A genetic algorithm for solving bus terminal location problem using data envelopment analysis with multi-objective programming

  2021cites this paper
• Optimal recycle price game theory model for second-hand mobile phone recycling

  2021cites this paper
• Tabu search and variable neighborhood search algorithms for solving interval bus terminal location problem

  2021cites this paper
• Balanced maximal covering location problem and its application in bike-sharing

  2020cites this paper
• University of Birmingham An Analysis of the Search Mechanisms of the Bees Algorithm

  2020cites this paper
• Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

  2020cites this paper
• Simulation-optimization framework for train rescheduling in rapid rail transit

  2020cites this paper
• Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

  2020cites this paper
• Multi-Step Heuristic Method for Bus Terminal Location Problem

  2019cites this paper
• A multi-objective meta-heuristic approach for transit network design and frequency setting problem in a bus transit system

  2019cites this paper
• Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search

  2019cites this paper
• Fuzzy GRASP with path relinking for the Risk-constrained Cash-in-Transit Vehicle Routing Problem

  2018cites this paper
• Variable Neighborhood Search

  2018cites this paper
• Efficiency of using VNS algorithm for forming heterogeneous groups for CSCL learning

  2017cites this paper
• A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers

  2017cites this paper