Combined Nearest Greedy Algorithm With Randomized Iterated Greedy Algorithm to Solve Waste Collection Problem
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملUsing Metaheuristic Algorithms Combined with Clustering Approach to Solve a Sustainable Waste Collection Problem
Sustainability is a monumental issue that should be considered in designing a logistics system. In order to incorporate sustainability concepts in our study, a waste collection problem with economic, environmental, and social objective functions was addressed. The first objective function minimized overall costs of the system, including establishment of depots and treatment facilities. Addressi...
متن کاملDual Greedy Algorithm for Conic Optimization Problem
In the paper we propose an algorithm for nding approximate sparse solutions of convex optimization problem with conic constraints and examine convergence properties of the algorithm with application to the index tracking problem and unconstrained l1-penalized regression.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Statistics and Probability
سال: 2020
ISSN: 1927-7040,1927-7032
DOI: 10.5539/ijsp.v9n3p66