Search strategies for the feeder bus network design problem

DOI10.1016/S0377-2217(97)00283-XzbMath0991.90011OpenAlexW2147338479MaRDI QIDQ1609905

Carlos Lúcio Martins, Margarida Vaz Pato

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00283-x

zbMATH Keywords

heuristicstransportationtabu searchnetwork designrouting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Transportation, logistics and supply chain management (90B06)

Related Items (6)

A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops ⋮ A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ A demand‐responsive feeder service with a maximum headway at mandatory stops ⋮ APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM ⋮ Optimal design of the feeder-bus network based on the transfer system

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Solving real-life vehicle routing problems efficiently using tabu search
• The Multi-Depot Routing Allocation Problem
• Implementing vehicle routing algorithms
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

This page was built for publication: Search strategies for the feeder bus network design problem