TITLE

# Meta-heuristic solution approaches for robust single allocation p-hub median problem with stochastic demands and travel times

AUTHOR(S)
PUB. DATE
February 2016
SOURCE
International Journal of Advanced Manufacturing Technology;Feb2016, Vol. 82 Issue 9-12, p1627
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Hub location problems appear at the core of strategic planning for many transportation and logistics problems. This class of optimization problems has received a wide gamut of research attention during the last few decades. However, the associated mathematical formulations are mainly developed with deterministic parameters to avoid the complexities and computational difficulties. In this paper, we put forward an extension to the uncapacitated single allocation p- hub median problem under uncertainty in which demands and travel times are stochastic. A robust optimization approach is used to deal with uncertainty in parameters and design a robust hub-and-spoke network. The developed model minimizes the total expected transportation costs, while bounding the relative regret in each scenario. To efficiently solve the model, a two-stage approach is investigated to design two hybrid heuristics. We firstly apply a meta-heuristic (i.e., variable neighborhood search (VNS) or particle swarm optimization (PSO)) to find the best combination for the hubs location. Then, by fixing the hubs location, the original model easily decomposes by scenario for which an efficient tabu search (TS) is designed. Encouraging results on a wide-range of test problems are reported.
ACCESSION #
112694147

## Related Articles

• Deriving Link Travel-Time Distributions via Stochastic Speed Processes. Kharoufeh, Jeffrey P.; Gautam, Natarajan // Transportation Science;Feb2004, Vol. 38 Issue 1, p97

We derive an analytical expression for the cumulative distribution function of travel time for a vehicle traversing a freeway link of arbitrary length. The vehicle's speed is assumed to be modulated by a random environment that can be modeled as a stochastic process. We first present a partial...

• A Software Tool for Assisting Experimentation in Dynamic Environments. Novoa-Hernández, Pavel; Cruz Corona, Carlos; Pelta, David A. // Applied Computational Intelligence & Soft Computing;4/22/2015, Vol. 2015, p1

In real world, many optimization problems are dynamic, which means that their model elements vary with time. These problems have received increasing attention over time, especially from the viewpoint of metaheuristics methods. In this context, experimentation is a crucial task because of the...

• Genetic procedure for the Single Straddle Carrier Routing Problem. MILI, Khaled; MILI, Faissal // International Journal of Advanced Computer Science & Application;Nov2012, Vol. 3 Issue 11, p20

This paper concentrates on minimizing the total travel time of the Straddle Carrier during the loading operations of outbound containers in a seaport container terminal. Genetic Algorithm is well-known meta-heuristic approach inspired by the natural evolution of the living organisms. Heuristic...

• Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows. Dabia, Said; Ropke, Stefan; van Woensel, Tom; De Kok, Ton // Transportation Science;Aug2013, Vol. 47 Issue 3, p380

This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW).We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider...

• Robust Finite-Time Output Feedback $$H_\infty$$ Control for Stochastic Jump Systems with Incomplete Transition Rates. Yang, Dong; Zhao, Jun // Circuits, Systems & Signal Processing;Jun2015, Vol. 34 Issue 6, p1799

This article aims to investigate the problem of robust finite-time output feedback $$H_\infty$$ control for stochastic jump systems with incomplete transition rates. Firstly, for the nominal stochastic jump systems, the sufficient conditions for the finite-time boundedness and finite-time...

• Travel times in queueing networks and network sojourns. Serfozo, Richard F. // Annals of Operations Research;1994, Vol. 48 Issue 1-4, p3

We first describe expected values of sojourn times for semi-stationary (or synchronous) networks. This includes sojourn times for units and sojourn times for the entire network. A typical sojourn time of a unit is the time it spends in a sector (set of nodes) while it travels through the...

• Two Chaotic Patterns of Dynamic Risk Definition for Solving Hazardous Materials Routing Problem. Mahmoudabadi, Abbas // Journal of Engineering (2314-4912);1/20/2015, Vol. 2015, p1

In the case of determining routes for hazardous material transportation, risk is considered as a main attribute. Transport risk, which is usually combined with other attributes such as cost or travel time, plays a significant role in determining paths for hazardous materials transportation....

• Minimization of Delay and Travel Time of Yard Trucks in Container Terminals Using an Improved GA with Guidance Search. Wang, Z. X.; Chan, Felix T. S.; Chung, S. H.; Niu, Ben // Mathematical Problems in Engineering;2/23/2015, Vol. 2015, p1

Yard truck scheduling and storage allocation problems (YTS-SAP) are two important issues that influence the efficiency of a container terminal. These two problems aim to determine the routing of trucks and proper storage locations for discharging containers from incoming vessels. This paper...

• Multimodal Network Equilibrium with Stochastic Travel Times. Meng, M.; Shao, C. F.; Wong, Y. D.; Zhang, J. // Mathematical Problems in Engineering;2014, p1

The private car, unlike public trafficmodes (e.g., subway, trolley) running along dedicated track-ways, is invariably subject to various uncertainties resulting in travel time variation. A multimodal network equilibrium model is formulated that explicitly considers stochastic link capacity...

Share