Journal ArticleDOI
The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems
Reads0
Chats0
TLDR
The results show that using all valid inequalities improves the solution time of the pure proposed model, and the proposed heuristic works efficiently in finding good-quality solutions for the proposed hub location-routing model.About:
This article is published in Computers & Industrial Engineering.The article was published on 2018-02-01. It has received 32 citations till now. The article focuses on the topics: Vehicle routing problem & Heuristic.read more
Citations
More filters
Journal Article
Integer programming formulations of discrete hub location problems
TL;DR: In this paper, integer programming formulations for four types of discrete hub location problems are presented: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
Journal ArticleDOI
Location‐routing problem: a classification of recent research
Journal ArticleDOI
A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources
TL;DR: In this paper, a green delivery-pickup problem for Home Hemodialysis Machines (HHMs) categorized as scarce commodities is addressed, and a multi-objective meta-heuristic algorithm, self-learning non-dominated sorting genetic algorithm (SNSGA-II), is developed for medium and large-sized problems.
Journal ArticleDOI
The reliable design of a hierarchical multi-modes transportation hub location problems (HMMTHLP) under dynamic network disruption (DND)
TL;DR: A novel mixed-integer mathematical programming formulation that is effective for a hierarchical multi-modes transportation hub location problem (HMMTHLP) is presented and a Monte Carlo simulation provides a strategy with which to compare and discuss the locations-allocations of a dynamic network with or without any disruption.
Journal ArticleDOI
Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window
TL;DR: The comparative results indicate that the MOICA can indeed provide better Pareto optimal solutions compared to NSGA-II for the large-scale problem instances.
References
More filters
Journal ArticleDOI
Integer Programming Formulation of Traveling Salesman Problems
TL;DR: The present paper provides yet another example of the versatility of integer programming as a mathematical modeling device by representing a generalization of the well-known “Travelling Salesman Problem” in integer programming terms.
Book ChapterDOI
Solution of a Large-Scale Traveling-Salesman Problem
TL;DR: The RAND Corporation in the early 1950s contained Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names as discussed by the authors.
Journal ArticleDOI
Network hub location problems : The state of the art
Sibel A. Alumur,Bahar Y. Kara +1 more
TL;DR: This paper classifies and surveys network hub location models, includes some recent trends on hub location and provides a synthesis of the literature.
Journal ArticleDOI
Integer programming formulations of discrete hub location problems
TL;DR: In this article, the authors present integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
Journal Article
Integer programming formulations of discrete hub location problems
TL;DR: In this paper, integer programming formulations for four types of discrete hub location problems are presented: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.