Results 21 to 30 of about 30,647 (208)

Velocity‐based stowage policy for a semiautomated fulfillment system

open access: yesProduction and Operations Management, EarlyView., 2022
Abstract Online retail fulfillment is increasingly performed by semiautomated fulfillment systems in which inventory is stored in mobile pods that are moved by robotic drives. In this paper, we develop a model that explores the benefits of velocity‐based stowage policies for semiautomated fulfillment systems, also known as robotic mobile fulfillment ...
Tolga Cezik   +2 more
wiley   +1 more source

ECOLOGICAL OPTIMIZATION OF CARGO TRANSPORTATION OF AN ENTERPRISE USING INFORMATION SYSTEMS

open access: yesФінансово-кредитна діяльність: проблеми теорії та практики, 2022
. The aim of the article is to systematize the existing ways to decrease the environmental load at the enterprise, in the country and in the world, to identify ways of greening the enterprise by using transportation means to transport goods from ...
О. Sazonets , A. Terebii
doaj   +1 more source

An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows [PDF]

open access: yesYugoslav Journal of Operations Research, 2013
General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems.
Mladenović Nenad   +2 more
doaj   +1 more source

GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020
The Travelling Salesman Problem (TSP) is a classical problem in combinatorial optimization that consists of finding the shortest tour through all cities such that the salesman visits each city only one time and returns to the starting city.
N. Mouttaki, J. Benhra, G. Rguiga
doaj   +1 more source

The Attractive Traveling Salesman Problem [PDF]

open access: yesEuropean Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdogan, Gunes   +2 more
openaire   +2 more sources

A Proposed Approach For Solving Asymmetric Travelling Salesman Problem by Fuzzy Ant Colony Optimization Algorithm

open access: yesJournal of Transportation and Logistics, 2018
Logistics sector is one of the most prominent field in economic development of a country. Travelling Salesman Problem which is studied commonly in logistic sector is also based a number of other problems.
Mehmet Aksaraylı, Osman Pala
doaj   +1 more source

Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem

open access: yesIEEE Access, 2023
Fleet management plays a central role in several application contexts such as distribution planning, mail delivery, garbage collection, salt gritting, field service routing. Since road congestion has a big impact on driving times, fleet management can be
Tommaso Adamo   +3 more
doaj   +1 more source

Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm [PDF]

open access: yesJournal of Project Management
The Multiple Travelling Salesman Problem (MTSP) is one of the prominent combinatorial optimization problems with both theoretical interest and practical applications.
M. Veeresh   +2 more
doaj   +1 more source

Enhancing logistics efficiency: A case study of genetic algorithm-based route optimization in distribution problem

open access: yesOPSI, 2023
The optimization of route planning is a critical consideration frequently happened in the logistics of product distribution. This study addresses distribution issues, such as long trip distances, which result in high distribution costs.
Hayati Mukti Asih   +4 more
doaj   +1 more source

A parallel implementation of ant colony optimization [PDF]

open access: yes, 2002
Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of ...
Lewis, A., Randall, M
core   +1 more source

Home - About - Disclaimer - Privacy