Results 91 to 100 of about 7,803 (235)
International Transactions in Operational Research, Volume 33, Issue 5, Page 3580-3597, September 2026.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
A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem [PDF]
A tabu search heuristic procedure for the capacitated facility location problem is developed, implemented and computationally tested. The heuristic procedure uses both short term and long term memories to perform the main search process as well as the ...
Minghe Sun
core
Neighbourhood Constraint for a Tabu Search [PDF]
, 2001 this paper we have introduced a new neighbourhood structure for the R Cmax problem. Although our algorithm is based in reassign and swap neighbourhood already used by other heuristics for this problem the approach is innovative.
Algorithm To Schedule
core
Using Bayesian networks with Tabu-search algorithm to explore risk factors for hyperhomocysteinemia. [PDF]
Sci Rep, 2023 Song W +7 more
europepmc +1 more source
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.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
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core
Higher Education Quarterly, Volume 80, Issue 3, July 2026.ABSTRACT This paper examines how the taboos and problems perceived by doctoral students are associated with their well‐being and their intentions to persist in or leave academia. We distinguish between doctoral problems—stressors associated with doctoral study—and doctoral taboos, understood as issues that remain difficult to voice in relationships ...
Tomáš Lintner +6 more
wiley +1 more source
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem [PDF]
, 2008 An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the ...
Salhi, Said +2 more
core +1 more source
‘I Don't Want to Kill Any More Mice’: Taboo and Silence in PhD Education
Higher Education Quarterly, Volume 80, Issue 3, July 2026.ABSTRACT Improving the experience and well‐being of doctoral students requires a deep and nuanced understanding of their challenges. Traditionally, researchers have used reactive methods, such as surveys and interviews, to address these issues. However, some topics may be difficult to capture through these approaches, particularly those that are ...
Saule Bekova, Ivan Smirnov
wiley +1 more source
An interior point algorithm for minimum sum-of-squares clustering [PDF]
, 2000 Copyright @ 2000 SIAM PublicationsAn exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of ...
Du Merle, O +7 more
core +1 more source