The urban waste collection problem and its disposal activities are among the most important municipal services involving many operational issues. In this paper, a mixed-integer linear programming (MILP) model was developed for the multi-trip Capacitated Arc Routing Problem (CARP) in order to minimize total cost. In the proposed model, depots and disposal facilities were located in different places. In order to validate the proposed model, several small-sized instances were solved by the CPLEX solver of GAMS software. Then, a hybrid algorithm using the Taguchi parameter design method was developed based on an improved Max-Min Ant System (IMMAS) to solve well-known test problems and large-sized instances. Computational results show high efficiency for the proposed algorithm. © 2018 Elsevier Ltd

Arun Kumar S

Department of Information Security

School of Computer Science and Engineering

Vellore Campus

Tirkolaee E.B

Alinaghian M

Hosseinabadi A.A.R

Sasi M.B

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Computers & Electrical Engineering

An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem

One of the most applicable versions of the Vehicle Routing Problem (VRP) which has been widely studied in logistic services is Capacitated Vehicle Routing Problem (CVRP). There are many algorithms to solve the CVRP to minimize total travelled distance. Some of the most recent and efficient metaheuristic algorithms are capable of generating solutions within 0.5% to 1% gap from the optimum for instance problems adopted from the literature considering hundreds or thousands of demand points. In this contribution, a novel hybrid algorithm is proposed based on Gravitational Emulation Local Search (GELS) and Genetic Algorithm (GA). This algorithm alleviates the weaknesses of the GELS algorithm. The performance of the proposed algorithm, which is called GELSGA, is compared with other meta-heuristics. The obtained results show that the proposed algorithm can compete vigorously with them. In addition, the proposed algorithm could obtain solutions close to the Best Known Solutions (BKS) for many instance problems. © 2013 IEEE.

Fulltext

IEEE Access

An Ameliorative Hybrid Algorithm for Solving the Capacitated Vehicle Routing Problem

Greenhouse gases (GHG) are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP) with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA) is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA) is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy. © 2018 by the authors.

Sustainability

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

Uncertain Supply Chain Management

Applying meta-heuristic algorithms for an integrated production-distribution problem in a two level supply chain

International Journal of Research in English Education

Book Review: Teaching English to Speakers of Other Languages: An Introduction

Journal of Investigative Dermatology

Important Information for Prospective JID Authors (and JID Readers, and JID Reviewers, and JID Editors)

IEEE Transactions on Cybernetics

A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition

Journal	Data powered by TypesetComputers & Electrical Engineering
Publisher	Data powered by TypesetElsevier BV
ISSN	0045-7906
Open Access	0