Results 71 to 80 of about 35,154 (219)
Abstract This paper introduces a novel heuristic method, the smart selective navigator (SSN), for addressing arc routing problems (ARPs) with a focus on integrating hard turn restrictions in urban winter operations. Addressing a significant gap in existing ARP methodologies, SSN seamlessly incorporates common side constraints, such as vehicle ...
Farhad Baghyari, Jaho Seo
wiley +1 more source
FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
In this study m-identical parallel machine scheduling problem with release date is considered. The objective function of the problem is minimization of the makespan.
Tamer Eren
doaj
A mutli-thread tabu search algorithm
This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel.
openaire +2 more sources
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data
Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension
Arpita Nagpal, Deepti Gaur
doaj +1 more source
A Novel Tabu Search Algorithm for Multi-AGV Routing Problem
In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time ...
Lining Xing +5 more
doaj +1 more source
A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments [PDF]
The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing.
Levine, J., Ritchie, G.
core
Exact solution algorithms for biobjective mixed integer programming problems
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
A fuzzy interval optimization approach for p-hub median problem under uncertain information.
Stochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios.
Yu Wang, Tao Zhu, Kaibo Yuan, Xin Li
doaj +1 more source

