scholarly journals Depot Location Analysis for Capacitated Vehicle Routing Problem: A Case Study of Solid Waste Management

2020 ◽  
Vol 4 (2) ◽  
Author(s):  
Ahmed T. Salawudeen ◽  
Emmanuel K. Akut ◽  
Izuagbe S. Momoh ◽  
Abdullahi A. Ibrahim ◽  
Mayo T. Zion ◽  
...  
Keyword(s):  
Waste Management ◽  
Solid Waste ◽  
Firefly Algorithm ◽  
Solid Waste Management ◽  
Real Life ◽  
Set Partitioning ◽  
Routing Problem ◽  
Optimal Position ◽  
Location Routing ◽  
Capacitated Vehicle

This paper presents an optimized solution to locate a depot on multiobjective instances of Capacitated Vehicle Pouting Problem (CVRP) using firefly algorithm (FA). The main objective of a depot location routing problem (LRP) is to obtain the optimal position to locate a depot in other to serve a set of customers ensuring the minimum possible total travelled distance across a search space. In this paper, the instances of solid waste management were created to simulate a real-life scenario of CVRP. This was formulated into a multiobjective optimization problem considering various depot positioning. Firefly Algorithm (FA) which is a metaheuristic technique was employed to navigate the travel path towards an optimal depot placement for solving the LRP model. Various depot positions which includes random, optimized, centered and eccentric were evaluated. Results showed that the optimized depot positioning approach obtained the best depot position as against the other possible positions. Results when compared with two metaheuristics approach Unified Hybrid Genetic Search (UHGS) and Iterated Local Search with Set Partitioning (ILS-SP) presented in literature also showed that, optimized depot positioning obtained the best results and FA can compete effectively with other metaheuristics approaches.

scholarly journals A mathematical model for the municipal solid waste location-routing problem with intermediate transfer stations

2015 ◽  
Vol 19 ◽  
Author(s):  
Hossein Asefi ◽  
Samsung Lim ◽  
Mojtaba Maghrebi
Keyword(s):  
Mathematical Model ◽  
Waste Management ◽  
Municipal Solid Waste ◽  
Solid Waste ◽  
Solid Waste Management ◽  
Municipal Solid Waste Management ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Efficient Planning

Municipal solid waste management is one of the challenging issues in mega cities due to various interrelated factors such as operational costs and environmental concerns. Cost as one of the most significant constraints of municipal solid waste management can be effectively economized by efficient planning approaches. Considering diverse waste types in an integrated municipal solid waste system, a mathematical model of the location-routing problem is formulated and solved in this study in order to minimize the total cost of transportation and facility establishment.

Sustainable vehicle routing problem for coordinated solid waste management

2021 ◽  
Vol 23 ◽  
pp. 100220
Author(s):  
Mohammad Mojtahedi ◽  
Amir M. Fathollahi-Fard ◽  
Reza Tavakkoli-Moghaddam ◽  
Sidney Newton
Keyword(s):  
Waste Management ◽  
Solid Waste ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Solid Waste Management ◽  
Routing Problem

scholarly journals A MILP model for the selective solid waste collection routing problem

2020 ◽  
Vol 13 ◽  
Author(s):  
Antoni Korcyl ◽  
Katarzyna Gdowska ◽  
Roger Książek
Keyword(s):  
Waste Management ◽  
Solid Waste ◽  
Optimization Problem ◽  
Solid Waste Management ◽  
Time Windows ◽  
Mixed Integer ◽  
Waste Collection ◽  
Solid Waste Collection ◽  
Routing Problem ◽  
Mip Model

Nowadays, in the European Union selective solid waste management be-longs to important responsibilities of municipalities. In Solid Waste Management (SWM) the main operational task is to set a schedule for solid waste collection and to find optimal routes for garbage trucks so that the total costs of solid waste collection service can be minimized subject to a series of constraints which guarantee not only fulfillment of SWM’s obligations but also desirable level of quality of that service. Optimization problem of garbage trucks routing is a special case of rich Vehicle Routing Problem as it has to cover following constraints: pickup nodes (clients) must be visited during their predefined time windows; the number and capacity of depots and specialized sorting units can-not be exceeded; each garbage truck can be assigned to at most one depot; each route should be dedicated to collecting one type of segregated solid waste, and the route must be served by a garbage truck which can collect that type of solid waste; availability of garbage trucks and their drivers must be respected; each garbage truck must be drained at a specialized sorting unit before going back to the depot. This paper contributes with a new Mixed-Integer Programming (MIP) model for the Selective Solid Waste Collection Routing Problem (SS-WCRP) with time windows, limited heterogeneous fleet, and different types of segregated solid waste to be collected separately. Utilization of MIP for solving small-sized instance of the Fleet Optimization Problem for Selective Solid Waste Collection (FOPSSWC) is and obtained results are reported.

A hybrid augmented ant colony optimization for the multi-trip capacitated arc routing problem under fuzzy demands for urban solid waste management

2019 ◽  
Vol 38 (2) ◽  
pp. 156-172 ◽  
Author(s):  
Erfan Babaee Tirkolaee ◽  
Iraj Mahdavi ◽  
Mir Mehdi Seyyed Esfahani ◽  
Gerhard-Wilhelm Weber
Keyword(s):  
Waste Management ◽  
Solid Waste ◽  
Ant Colony Optimization ◽  
Solid Waste Management ◽  
Ant Colony ◽  
Arc Routing ◽  
Routing Problem ◽  
Capacitated Arc Routing Problem ◽  
Urban Solid Waste ◽  
Capacitated Arc Routing

Nowadays, urban solid waste management is one of the most crucial activities in municipalities and their affiliated organizations. It includes the processes of collection, transportation and disposal. These major operations require a large amount of resources and investments, which will always be subject to limitations. In this paper, a chance-constrained programming model based on fuzzy credibility theory is proposed for the multi-trip capacitated arc routing problem to cope with the uncertain nature of waste amount generated in urban areas with the aim of total cost minimization. To deal with the complexity of the problem and solve it efficiently, a hybrid augmented ant colony optimization algorithm is developed based on an improved max–min ant system with an innovative probability function and a simulated annealing algorithm. The performance of hybrid augmented ant colony optimization is enhanced by using the Taguchi parameter design method to adjust the parameters’ values optimally. The overall efficiency of the algorithm is evaluated against other similar algorithms using well-known benchmarks. Finally, the applicability of the suggested methodology is tested on a real case study with a sensitivity analysis to evolve the managerial insights and decision aids.

Sustainable municipal solid waste management (MSWM) in the smart cities in Indian context

2022 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Vikas Thakur ◽  
Dibya Jyoti Parida ◽  
Vivek Raj
Keyword(s):  
Waste Management ◽  
Municipal Solid Waste ◽  
Solid Waste ◽  
Solid Waste Management ◽  
Smart Cities ◽  
Real Life ◽  
Municipal Solid Waste Management ◽  
Interpretive Structural Modeling ◽  
Content Type ◽  
Healthcare Facilities

PurposeSmart cities in India are going to be a reality very soon by turning challenges into opportunities for the society. However, due to rapid increase in population burden, fast urbanization and growing demand of advanced services in the smart cities, the quantity of per capita municipal solid waste (MSW) has escalated. Moreover, the COVID-19 pandemic has further challenged the municipal solid waste management (MSWM) system with the increasing amount of infectious wastes coming from households (HHs), quarantine centers, healthcare facilities, vaccination centers, etc. Therefore, the present study attempts to explore and analyze the various dimensions of sustainable MSWM system in the smart cities.Design/methodology/approachThe study identifies 13 factors of sustainable MSWM system from the literature, field surveys and stakeholders' opinions. Thereafter, stakeholders' opinions are collected and analyzed using total interpretive structural modeling (TISM) approach to explore the interrelationships among the factors of sustainable MSWM system. These relationships are further validated through the empirical investigation of the real-life case study of Rourkela Municipal Corporation (RMC), Odisha, India.FindingsThe TISM approach places all 13 factors into six levels in the hierarchical digraph depending upon the inputs received from the various stakeholders on their interrelationships. Study also validates the proposed TISM model by collecting the data of RMC, Odisha, on the development of MSWM system over the period of 2015–2021.Practical implicationsThe study also highlights various implications for the other developing cities and stakeholders to set up the roadmap for developing the sustainable MSWM system. Study defines “IT platform” and “awareness among citizens” as the base of the sustainable MSWM system in any smart city.Originality/valueThe present study is the first of its kind to explore the interrelationships among the factors of sustainable MSWM system by using TISM approach. Moreover, the proposed TISM framework is further validated through the empirical journey of one of the smart cities in India.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document