Facility location, layout, design, and materials handling
Finding optimum facility’s layout by developed simulated annealing algorithm

H. Jafari; M. Ehsanifar; A. Sheykhan

Volume 9, Issue 2 , June 2020, , Pages 172-182

https://doi.org/10.22105/riej.2020.218913.1119

Abstract
  The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial optimization belonging to the NP-hard problems’ class and has a wide application in the placement of facilities. Thus far, many efforts have been made to solve this problem and countless algorithms have been developed ...  Read More

Facility location, layout, design, and materials handling
A simulated annealing optimization algorithm for equal and un-equal area construction site layout problem

N. Moradi; Sh. Shadrokh

Volume 8, Issue 2 , June 2019, , Pages 89-104

https://doi.org/10.22105/riej.2019.169867.1073

Abstract
  Construction Site Layout Planning (CSLP) is an important problem because of its impact on time, cost, productivity, and safety of the projects. In this paper, CSLP is formulated by the Quadratic Assignment Problem (QAP). At first, two case studies including equal and un-equal area facilities are solved ...  Read More

Open Vehicle Routing Problem Optimization under Realistic Assumptions

Kh. Pichka; B. Ashjari; A. Ziaeifar; P. Nickbeen

Volume 3, Issue 2 , May 2014, , Pages 46-55

Abstract
  MDOVRP is a variant of classical VRP, which seeks to find a set of non-depot returning vehicle routes dispatching form several depots. A new integer linear programming model is presented considering limited number of vehicles at each depot. Randomly generated smallsized MDOVRPs are solved for validation ...  Read More

Solving Fuzzy Step Fixed Charge Transportation Problems via Metaheuristics

F. Rajabi; S.E. Najafi; M. Hajiaghaei-Keshteli; S. Molla-Alizadeh-Zavardehi

Volume 2, Issue 3 , September 2013, , Pages 24-34

Abstract
  In the present paper the step fixed charge transportation problem under uncertainty, particularly when variable and fixed cost are given in fuzzy forms, is formulated. In order to solve the problem, two metaheuristic, simulated annealing algorithm (SA) and variable neighborhood search (VNS), are developed ...  Read More