eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1351
1372
10.22034/2016.3.01
2697
Defining Robust Recovery Solutions for Preserving Service Quality during Rail/Metro Systems Failure
Luca D'Acierno
luca.dacierno@unina.it
1
Antonio Placido
antonio.placido@dappolonia.it
2
Mariisa Botte
marilisa.botte@unina.it
3
Mariano Gallo
gallo@unisannio.it
4
Bruno Montella
bruno.montella@unina.it
5
Department of Civil, Architectural and Environmental Engineering, Federico II University of Naples, Naples, Italy
D’Appolonia S.p.A., Naples, Italy
Department of Civil, Architectural and Environmental Engineering, Federico II University of Naples, Naples, Italy
Department of Engineering, University of Sannio, Benevento, Italy
Department of Civil, Architectural and Environmental Engineering, Federico II University of Naples, Naples, Italy
In this paper, we propose a sensitivity analysis for evaluating the effectiveness of recovery solutions in the case of disturbed rail operations. Indeed, when failures or breakdowns occur during daily service, new strategies have to be implemented so as to react appropriately and re-establish ordinary conditions as rapidly as possible. In this context, the use of rail simulation is vital: for each intervention strategy it provides the evaluation of interactions and performance analysis prior to actually implementing the corrective action. However, in most cases, simulation tasks are deterministic and fail to allow for the stochastic distribution of train performance and delays. Hence, the strategies adopted might not be robust enough to ensure effectiveness of the intervention. We therefore propose an off-line procedure for disruption management based on a microscopic and stochastic rail simulation which considers both service operation and travel demand. An application in the case of a real metro line in Naples (Italy) shows the benefits of the proposed approach in terms of service quality.
http://www.ijsom.com/article_2697_50ad4d36c45bf6afcc42e7bb7698caaa.pdf
Sensitivity Analysis
Public Transport Management
Rail System
Travel Demand Estimation
Quality of Service
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1373
1390
10.22034/2016.3.02
2704
مقاله پژوهشی
Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route
Mohammad Mirabi
mirabi@haeri.ac.ir
1
Nasibeh Shokri
nasibeh_shokri@yahoo.com
2
Ahmad Sadeghieh
sadegheih@yazd.ac.ir
3
Department of industrial engineering, Ayatollah Haeri University of Meybod, Meybod, Yazd, Iran
Group of industrial engineering, ElM-O-Honar University, Yazd Iran
Group of industrial engineering, Yazd University, Yazd, Iran
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM) and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.
http://www.ijsom.com/article_2704_9c2fd365b3e6fa40a7833aebad071dfb.pdf
Vehicle routing problem
Multi-Depot
Flexible end depot
Genetic Algorithm
Clustering
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1391
1412
10.22034/2016.3.03
2707
مقاله پژوهشی
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
Denis Pinha
deniscruzpinha@gmail.com
1
Rashpal Ahluwalia
rashpal.ahluwalia@mail.wvu.edu
2
Pedro Senna
pedro.senna@cefet-rj.br
3
West Virginia University, Morgantown, WV, USA
West Virginia University, Morgantown, WV, USA
Federal Center for Technological Education of Rio de Janeiro, Rio de Janeiro, Brazil
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.
http://www.ijsom.com/article_2707_1a55769b9264de00d8f84eb6bc21977d.pdf
Resource constrained project scheduling
Mathematical formulation
Discrete event simulation
decision support system
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1413
1428
10.22034/2016.3.04
2712
مقاله پژوهشی
A Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II
Masoud Rabbani
mrabani@ut.ac.ir
1
Safoura Famil Alamdar
safouraalamdar@ut.ac.ir
2
Parisa Famil Alamdar
safouralamdar@ut.ac.ir
3
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, Amir Kabir University, Tehran, Iran
In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow shop scheduling problem is well known as NP-hard problem and its complexity has been discussed by several researchers. Given that NSGA-II algorithm is one of the strongest and most applicable algorithm in solving multi-objective optimization problems, it is used to solve this problem. To increase algorithm performance, Taguchi technique is used to design experiments for algorithm’s parameters. Numerical experiments are proposed to show the efficiency and effectiveness of the model. Finally, the results of NSGA-II are compared with SPEA2 algorithm (Strength Pareto Evolutionary Algorithm 2). The experimental results show that the proposed algorithm performs significantly better than the SPEA2.
http://www.ijsom.com/article_2712_f34502dd153ec8bd0beeb77847d1d164.pdf
Re-entrant manufacturing system
Non-dominated sorting genetic algorithm (NSGA-II)
Taguchi parameter setting
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1429
1441
10.22034/2016.3.05
2708
مقاله پژوهشی
Competitive Supply Chain Network Design Considering Marketing Strategies: A Hybrid Metaheuristic Algorithm
Ali Akbar Hasani
aa.hasani@shahroodut.ac.ir
1
Industrial Engineering and Management Department, Shahrood University of Technology, Shahrood, Iran
In this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. Various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. The goal of the proposed model is to efficiently respond to the customers’ demands in the presence of the pre-existing competitors and the price inelasticity of demands. The proposed optimization model considers multiple objectives that incorporate both market share and total profit of the considered supply chain network, simultaneously. To tackle the proposed multi-objective mixed-integer nonlinear programming model, an efficient hybrid meta-heuristic algorithm is developed that incorporates a Taguchi-based non-dominated sorting genetic algorithm-II and a particle swarm optimization. A variable neighborhood decomposition search is applied to enhance a local search process of the proposed hybrid solution algorithm. Computational results illustrate that the proposed model and solution algorithm are notably efficient in dealing with the competitive pressure by adopting the proper marketing strategies.
http://www.ijsom.com/article_2708_bd45461480b681ad90ed7ad588309b4c.pdf
Supply Chain Management
Marketing strategies
Hybrid metaheuristic
Non-dominated sorting genetic algorithm-II
Particle swarm optimization
Variable neighborhood decomposition search
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1442
1465
10.22034/2016.3.06
2705
مقاله پژوهشی
Joint Optimization of Star P-hub Median Problem and Seat Inventory Control Decisions Considering a Hybrid Routing Transportation System
Hamid Tikani
hamid.tikani@yahoo.com
1
Mahboobeh Honarvar
mhonarvar@yazd.ac.ir
2
Yahia Zare Mehrjerdi
mehrjerdyazd@gmail.com
3
Department of Industrial Engineering, Yazd University, Yazd, Iran
Department of Industrial Engineering, Yazd University, Yazd, Iran
Department of Industrial Engineering, Yazd University, Yazd, Iran
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 network and includes both hub-stop and non-stop flights. This problem is formulated as a two-stage stochastic integer program with mixed-integer recourse. We solve various instances carried out from the Turkish network data set. Due to the NP-hardness of the problem, we propose a hybrid optimization method, consisting of an evolutionary algorithm based on genetic algorithm and exact solution. The quality of the solutions found by the proposed meta-heuristic is compared with the original version of GA and the mathematical programming model. The results obtained by the proposed model imply that integrating hub location and seat inventory control problem would help to increase the total revenue of airline companies. Also, in the case of serving non-stop flights, the model can provide more profit by employing less number of hubs.
http://www.ijsom.com/article_2705_d75a1037509acbf0f8a926e1a2c0a7f4.pdf
Perishable products
P-hub median
Seat allocation
Evolutionary algorithms
Fare class segmentation
Network revenue management
eng
Kharazmi University
International Journal of Supply and Operations Management
23831359
23832525
2016-11-01
3
3
1466
1485
10.22034/2016.3.07
2713
The Identifying, Evaluating and Prioritizing the Factors Affecting Customers’ Satisfaction with E-service Centers of Iran's Police
Seyed Ali Ziaee Azimi
sa_zazimi@yahoo.com
1
Mohammad Saidi-Mehrabad
mehrabad@iust.ac.ir
2
Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
The present research is classified as an applied one employing a descriptive survey design to describe the status quo of the factors affecting customers’ satisfaction with the E-service centers of Iran’s police, known as 10 + police centers. The research population involves all the costumers of the 10+ police centers, among which 420 individuals were chosen through simple random sampling technique. Furthermore, 45 10 + police service centers were selected with probability proportional to size. After Determining the validity and reliability of the researcher-made questionnaire, it has been used to collect the required data. Then, a conceptual model was developed using the theoretical framework and background literature. After that, SPSS software was used to examine and make an analysis of the research hypothesises. The findings indicate that all the identified indices to the customers’ satisfaction with the 10 + police e- service centers (including trust and confidence, staff performance, system facility, environmental facility, basic amenity, providing sufficient notification, time and cost, easy access to the office) have an effect on the customers’ satisfaction. In the end, some practical suggestions were made for an improvement in the satisfaction level of the customers to the 10 + police e- service centers.
http://www.ijsom.com/article_2713_b66e10128362d2d84c2b93296ab1458e.pdf
10 +police
Measuring the customer satisfaction
Improvement in quality of the services