A dynamic programming heuristic for the P-median problem
Article Abstract:
A heuristic algorithm is developed for the P-median problem and was tested for real world effectivity by employing the algorithm for a siting problem. The new heuristic was developed from by extending the myopic or greedy adding algorithm, and was found to generate a large number of solutions which correspond to an optimization of a P-median objective of reducing demand weighted average distance between a selected site and customer locations.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
Article Abstract:
A restricted dynamic programming heuristic algorithm has been developed for the time dependent traveling salesman problem (TSP). The new algorithm cannot guarantee optimality since it retains only a user-specified number of partial tours at each stage. However, it permits the user to choose a middle ground between an optimal solution and a nearest-neighbor solution. It can also solve TSPs which are larger than the exact algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A practical heuristic for a large scale vehicle routing problem. Postoptimizing equilibrium flows on large scale networks
- Abstracts: A brave face: British banks. Clutching at shoots
- Abstracts: Using the interaction approach to understand international trade shows. Emerging issues related to marketing and business activity in Asia Pacific
- Abstracts: Design of tool magazine and operational areas for a multi-tool machine. part 2 The predictionucorrection approach to nonlinear complementarity problems