This paper presents a simple and effective Genetic Algorithm (GA) for the two-stage capacitated facility location problem (TSCFLP). The TSCFLP is a typical location problem which arises in freight transportation. In this problem, a single product must be transported from a set of plants to meet customers demands, passing out by intermediate depots. The objective is to minimize the operation cos...

The multi-depot pickup and delivery problem with heterogeneous fleet and soft time windows (MDPDPHSTW) requires to find a minimum cost routing for a fleet vehicles with different capacities and based at different depots, satisfying a given set of customers. A customer request is associated with two locations: a source where a certain demand must be picked up and a destination where this demand ...

This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19, 31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In hub transportation networks routes between customers and the hub are often short, i.e. involve only on...

Cho, Hyejin. M.S.I.E., Purdue University, May 2016, The Casualty Transportation of Ebola Outbreak in Liberia: A Simulation Study. Major Professors: Seokcheon Lee and Yuehwern Yih. In this paper, we have solved the unique problem of casualty transportation problem under Ebola by developing dynamic policies for vehicle routing to provide practical decision support. The objective of the proposed m...

in this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. we consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. the transportation system arises in the form of a star/star net...

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

In this work we propose two memetic algorithms based on a Nondominated Sorting Genetic Algorithm II (NSGA-II) scheme for solving a bi-objective Transportation Location Routing Problem (TLRP). The TLRP we are dealing with, can be seen as an extension of the two stage Location Routing Problem, with a transportation problem with truck capacity as first stage. Two objectives are considered: minimiz...

The location-routing problem (LRP), which integrates location and routing decisions, has been an attraction to both researchers and practitioners. LRP as an important business problem has its own inherent uncertainty; especially, considering phenomena such as traffic congestion and weather conditions and their impact on transportation costs, routing in LRP is subject to uncertainty. In this pap...