Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Metaheuristics and Applications in Operations Research
share announcement

Metaheuristics and Applications in Operations Research

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 September 2021) | Viewed by 4738

Special Issue Editors

Dr. Dhananjay R. Thiruvady

E-Mail Website
Guest Editor
School of Information Technology, Deakin University, Geelong, VIC 3125, Australia
Interests: optimisation; metaheuristics; swarm intelligence
Special Issues, Collections and Topics in MDPI journals
Dr. Asef Nazari

E-Mail Website
Guest Editor
School of Information Technology, Deakin University, Waurn Ponds, VIC 3216, Australia

Special Issue Information

Dear Colleagues,

The Special Issue "Metaheuristics and Applications in Operations Research" is now opening for submissions on the topics below:

  • Metaheuristics in Combinatorial Optimisation
  • Metaheuristics in Logistics and Scheduling
  • Large-scale Heuristic Optimisation
  • Multi-objective Heuristic Optimisation
  • Metaheuristics in Healthcare
  • Metaheuristics in Energy
  • Metaheuristics in Mining
  • Metaheuristics in Bio-security
  • Hybrids of Metaheuristics
  • Hybrids of Metaheuristics and Exact Approaches

Dr. Dhananjay R. Thiruvady
Dr. Asef Nazari
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (1 paper)

Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

17 pages, 2105 KiB  
Article
Solving the Two Echelon Vehicle Routing Problem Using Simulated Annealing Algorithm Considering Drop Box Facilities and Emission Cost: A Case Study of Reverse Logistics Application in Indonesia
by Marco Reinaldi, Anak Agung Ngurah Perwira Redi, Dio Fawwaz Prakoso, Arrie Wicaksono Widodo, Mochammad Rizal Wibisono, Agus Supranartha, Rahmad Inca Liperda, Reny Nadlifatin, Yogi Tri Prasetyo and Sekar Sakti
Algorithms 2021, 14(9), 259; https://doi.org/10.3390/a14090259 - 30 Aug 2021
Cited by 6 | Viewed by 3672
Abstract
A two echelon distribution system is often used to solve logistics problems. This study considers a two-echelon distribution system in reverse logistics context with the use of drop box facility as an intermediary facility. An optimization model of integer linear programming is proposed, [...] Read more.
A two echelon distribution system is often used to solve logistics problems. This study considers a two-echelon distribution system in reverse logistics context with the use of drop box facility as an intermediary facility. An optimization model of integer linear programming is proposed, representing a two-echelon vehicle routing problem with a drop box facility (2EVRP-DF). The aim is to find the minimum total costs consisting of vehicle transportation costs and the costs to compensate customers who have to travel to access these intermediary facilities. The results are then compared to those of common practice in reverse logistics. In common practice, customers are assumed to go directly to the depot to drop their goods. In addition, this study analyzes the environmental impact by adding a component of carbon emissions emitted by the vehicles. A set of comprehensive computational experiments is conducted. The results indicate that the 2EVRP-DF model can provide optimal costs and lower carbon emissions than the common practice. Full article
(This article belongs to the Special Issue Metaheuristics and Applications in Operations Research)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-1
Back to TopTop