Results 31 to 40 of about 5,666,790 (163)

Ant colony optimization with direct communication for the traveling salesman problem [PDF]

, 2010
This article is posted here with permission from IEEE - Copyright @ 2010 IEEEAnts in conventional ant colony optimization (ACO) algorithms use pheromone to communicate.
Yang, S, Shengxiang Yang, Mavrovouniotis, M, Michalis Mavrovouniotis, Mavrovouniotis, Michalis, Yang, Shengxiang   +5 more
core   +1 more source

Mirror alignment by particle swarm optimization for synchrotron radiation beamlines

Journal of Synchrotron Radiation, EarlyView.
A particle swarm optimization‐based automated two‐mirror alignment method was developed to restore high‐flux beams in approximately 5 min, and its 15 month deployment demonstrated its robustness and reliability.This article proposes a particle swarm optimization (PSO)‐based automated mirror‐alignment methodology that enables the utilization of high ...
Bunyo Okumura, Kunihiro Goto, Akinobu Fujii, Takamasa Nonaka, Tsukasa Shimizu, Yoshihiro Ohama   +5 more
wiley   +1 more source

Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Technologies, 2019
GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS
Christos Papalitsas, Theodore Andronikos
doaj   +1 more source

A matheuristic for the traveling salesman problem with positional consistency constraints

International Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

A Reinforcement Learning Framework for Traveling Salesman and Vehicle Routing Problem with Drones

Drones
The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two classical combinatorial optimization problems. In recent years, their drone-assisted variants, the Traveling Salesman Problem with Drones (TSP-D) and the Vehicle Routing ...
Qi Li, Tad Gonsalves
doaj   +1 more source

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]

Journal of Optimization in Industrial Engineering, 2010
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj  

The Electric Vehicle Traveling Salesman Problem on Digital Elevation Models for Traffic-Aware Urban Logistics

Algorithms, 2023
With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency.
Yusef Ahsini, Pablo Díaz-Masa, Belén Inglés, Ana Rubio, Alba Martínez, Aina Magraner, J. Alberto Conejero   +6 more
doaj   +1 more source

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

International Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

International Transactions in Operational Research, EarlyView.
Abstract We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods.
Sara Charaf, Guy Desaulniers, Frédéric Quesnel, Duygu Taş, Simme Douwe P. Flapper, Tom Van Woensel   +5 more
wiley   +1 more source

An immune system based genetic algorithm using permutation-based dualism for dynamic traveling salesman problems [PDF]

, 2009
Copyright @ Springer-Verlag Berlin Heidelberg 2009.In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world applications. This paper
Yang, S, Wang, Dingwei, Shengxiang Yang, Liu, Lili, Lili Liu, Dingwei Wang, Yang, Shengxiang, Wang, D, Liu, L   +8 more
core   +1 more source