A hybrid greedy randomized heuristic for designing uncertain transport network layout
نویسندگان
چکیده
The foundations of efficient management are laid on transport networks in various scientific and industrial fields. Nonetheless, establishing an optimum network design (TND) is complicated due to uncertainty the operating environment. As a result, uncertain may be more realistic representation actual network. present study deals with TND problem which programming greedy randomized adaptive search procedure (GRASP) used develop original optimization framework propose solution technique for obtaining cost-efficient designs. To this end, we originally concept α-shortest cycle (α-SC) employing pessimistic value criterion, given user-defined predesignated confidence level α. Employing operational law programming, new auxiliary chance-constrained model established problem, prove existence equivalence relation between TNDs those deterministic Specifically, articulate how obtain distribution overall optimal network’s cost. After all, effectiveness practical performance heuristic illustrated by adopting samples different topology from case show our approach work highlight some heuristic’s features.
منابع مشابه
A Non-greedy Local Search Heuristic for Facility Layout Problem
This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function incremen...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملBuilding a Heuristic for Greedy Search
Suboptimal heuristic search algorithms such as greedy bestfirst search allow us to find solutions when constraints of either time, memory, or both prevent the application of optimal algorithms such as A*. Guidelines for building an effective heuristic for A* are well established in the literature, but we show that if those rules are applied for greedy best-first search, performance can actually...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems With Applications
سال: 2022
ISSN: ['1873-6793', '0957-4174']
DOI: https://doi.org/10.1016/j.eswa.2021.116151