An Adaptive Search Heuristic for the Capacitated Fixed Charge Location Problem

2006 ◽  
pp. 348-355 ◽  
Author(s):  
Harry Venables ◽  
Alfredo Moscardini
Keyword(s):  
Location Problem ◽  
Fixed Charge ◽  
Adaptive Search ◽  
Search Heuristic

THE FIXED CHARGE MAXIMAL COVERING LOCATION PROBLEM

2005 ◽  
Vol 71 (3) ◽  
pp. 199-215 ◽  
Author(s):  
Richard L. Church ◽  
Rhonda R. Davis
Keyword(s):  
Location Problem ◽  
Fixed Charge ◽  
Maximal Covering

A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM

2013 ◽  
Vol 30 (01) ◽  
pp. 1250046 ◽  
Author(s):  
FRANCESCA GUERRIERO ◽  
MARIA ELENA BRUNI ◽  
FRANCESCA GRECO
Keyword(s):  
Hybrid Approach ◽  
Terms Of Trade ◽  
Computational Time ◽  
Test Problems ◽  
Fixed Costs ◽  
Computational Results ◽  
Adaptive Search ◽  
Solution Quality ◽  
Search Heuristic ◽  
Number Of Customers

This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm is evaluated on well-known instances taken from the literature and on a set of randomly generated test problems, varying in the number of customers. Extensive computational results show the effectiveness of the hybrid approach in terms of trade-off between solution quality and computational time.

The fixed charge maximal covering location problem

1992 ◽  
Vol 71 (3) ◽  
pp. 199-215 ◽  
Author(s):  
Richard L. Church ◽  
Rhonda R. Davis
Keyword(s):  
Location Problem ◽  
Fixed Charge ◽  
Maximal Covering
Sign in / Sign up

Export Citation Format

Share Document