


default search action
Journal of Heuristics, Volume 28
Volume 28, Number 1, February 2022
- Victor Silva, Clauirton A. Siebra
, Anand Subramanian:
Intersections management for autonomous vehicles: a heuristic approach. 1-21 - Daiane Maria De Genaro Chiroli
, Sérgio Fernando Mayerle, João Neiva de Figueiredo
:
Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints. 23-59 - Alex Gliesch
, Marcus Ritt:
A new heuristic for finding verifiable k-vertex-critical subgraphs. 61-91 - Sandra Ulrich Ngueveu
, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum:
Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs. 93-120 - Alejandra Casado
, Sergio Pérez-Peló
, Jesús Sánchez-Oro, Abraham Duarte
:
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem. 121-146
Volume 28, Number 2, April 2022
- Ichiro Ide, Huynh Thi Thanh Binh:
Special issue on "The Eighth International Symposium on Information and Communication Technology - SoICT 2017". 147-148 - Van-Quyet Nguyen, Quyet-Thang Huynh
, Kyungbaek Kim
:
Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries. 149-169 - Tu Minh Phuong, Le Cong Linh, Ngo Xuan Bach:
Identifying intentions in forum posts with cross-domain data. 171-192 - Dien Dinh, Le Thanh Nguyen
:
English-Vietnamese cross-language paraphrase identification using hybrid feature classes. 193-209 - Minh-Triet Tran
, Lap Q. Trieu, Huy Q. Tran:
Document representation and classification with Twitter-based document embedding, adversarial domain-adaptation, and query expansion. 211-233
Volume 28, Number 3, June 2022
- Sepide Lotfi, Khaled F. Abdelghany
:
Ride matching and vehicle routing for on-demand mobility services. 235-258 - Rhyd Lewis
, Padraig Corcoran:
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. 259-285 - Francisco Casas
, Claudio E. Torres
, Ignacio Araya:
A heuristic search based on diversity for solving combinatorial problems. 287-328 - Filipe Rodrigues
, Agostinho Agra
, Lars Magnus Hvattum
, Cristina Requejo
:
Weighted iterated local branching for mathematical programming problems with binary variables. 329-350 - Mohamed Salim Amri Sakhri
, Mounira Tlili, Ouajdi Korbaa
:
A memetic algorithm for the inventory routing problem. 351-375
Volume 28, Number 4, August 2022
- Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
:
Incomplete MaxSAT approaches for combinatorial testing. 377-431 - Ricardo N. Liang
, Eduardo A. J. Anacleto, Cláudio N. Meneses
:
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems. 433-479 - Raka Jovanovic
, Antonio Sanfilippo, Stefan Voß
:
Fixed set search applied to the multi-objective minimum weighted vertex cover problem. 481-508 - Alexander E. I. Brownlee
, Michael G. Epitropakis, Jeroen Mulder, Marc Paelinck, Edmund K. Burke:
A systematic approach to parameter optimization and its application to flight schedule simulation software. 509-538 - Leandro Rincon Costa, Daniel Aloise
, Luca Giovanni Gianoli, Andrea Lodi:
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds. 539-582
Volume 28, Number 5, December 2022
- Mu He, Qinghua Wu, Yongliang Lu:
Breakout local search for the cyclic cutwidth minimization problem. 583-618 - Liang Sun:
Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times. 619-651 - Martin Simensen
, Geir Hasle, Magnus Stålhane:
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem. 653-697

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.