English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Article history: Received February 2, 2018 Accepted June 7 2018 Available online June 7 2018 This paper presents a model to solve the multi-objective location-routing problem with capacitated vehicles. The main purposes of the model are to find the optimal number and location of depots, the optimal number of vehicles, and the best allocation of customers to distribution centers and to the vehicles. In addition, the model seeks to optimize vehicle routes and sequence to serve the customers. The proposed model considers vehicles’ traveled distances, service time and waiting time while guaranteeing that the sum of these parameters is lower than a predetermined value. Two objective functions are investigated. First objective function minimizes the total cost of the system and the second one minimizes the gap between the vehicles’ traveled distances. To solve the problem, a Multi-Objective Imperialist Competitive Algorithm (MOICA) is developed. The efficiency of the MOICA is demonstrated via comparing with a famous meta-heuristics, named Non-Dominated Sorting Genetic Algorithm-II (NSGA-II). Based on response surface methodology, for each algorithm, several crossover and mutation strategies are adjusted. The results, in terms of two well-known comparison metrics, indicate that the proposed MOICA outperforms NSGA-II especially in large sized problems. ensee Growing Science, Canada by the authors; lic 9 © 201

A multi-depot location routing problem to reduce the differences between the vehicles’ traveled distances; a comparative study of heuristics