A hybrid heuristic for the uncapacitated hub location problem

Article Abstract:

A new heuristic method is developed to solve the uncapacitated hub location problem (UHP). The hybrid heuristic, which was based on genetic algorithms and tabu search (TS), was able to determine the number of hubs, the location of hubs and the assignment of spokes to the hubs. The genetic algorithm and the TS component proved useful in diversifying the search and localizing the search, respectively.

Algorithms

---

Search strategies for the feeder bus network design problem

Article Abstract:

A combined building plus improving heuristic procedure demonstrates the ability to solve the problem that arises in public transport system, the Feeder Bus Design Network Problem (FBDP). The procedure obtains a solution through a sequential savings or a two-phase method that includes local search and tabu search heuristics with different strategies.

Local transit

---

Similar abstracts:

• Abstracts: A tabu search heuristic procedure for the fixed charge transportation problem. Determining buffer location and size in production lines using tabu search
• Abstracts: Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.