Saïd Salhi

Orcid: 0000-0002-3384-5240

Affiliations:
  • University of Kent, United Kingdom


According to our database1, Saïd Salhi authored at least 100 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The truck-drone routing optimization problem: mathematical model and a VNS approach.
Optim. Lett., May, 2024

<i>Journal of the Operational Research Society</i> (JORS): The last 40 years.
J. Oper. Res. Soc., February, 2024

Editorial to the 75 <sup>th</sup> volume of the Journal of the Operational Research Society.
J. Oper. Res. Soc., January, 2024

Correction to: A novel integration of MCDM methods and Bayesian networks: the case of incomplete expert knowledge.
Ann. Oper. Res., January, 2024

2023
A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector.
Int. J. Prod. Res., November, 2023

Variable Neighborhood Search: The power of change and simplicity.
Comput. Oper. Res., July, 2023

Operational Research in times of crisis: Experiences with COVID-19.
J. Oper. Res. Soc., February, 2023

A novel integration of MCDM methods and Bayesian networks: the case of incomplete expert knowledge.
Ann. Oper. Res., 2023

2022
Multi-period travelling politician problem: A hybrid metaheuristic solution method.
J. Oper. Res. Soc., 2022

Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor.
Eur. J. Oper. Res., 2022

A continuous location and maintenance routing problem for offshore wind farms: Mathematical models and hybrid methods.
Comput. Oper. Res., 2022

2021
Editorial.
J. Oper. Res. Soc., 2021

The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach.
Comput. Oper. Res., 2021

The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach.
Ann. Oper. Res., 2021

2020
The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods.
J. Glob. Optim., 2020

An effective real time GRASP-based metaheuristic: Application to order consolidation and dynamic selection of transshipment points for time-critical freight logistics.
Expert Syst. Appl., 2020

Formulation and a two-phase matheuristic for the roaming salesman problem: Application to election logistics.
Eur. J. Oper. Res., 2020

Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches.
Eur. J. Oper. Res., 2020

2019
Design of a parallel genetic algorithm for continuous and pattern-free heliostat field optimization.
J. Supercomput., 2019

Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm.
J. Oper. Res. Soc., 2019

A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes.
Int. J. Math. Oper. Res., 2019

Preface: advances in theoretical and practical combinatorial optimization.
Ann. Oper. Res., 2019

The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem.
Ann. Oper. Res., 2019

2018
The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory.
Expert Syst. Appl., 2018

2017
The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approaches.
Eur. J. Oper. Res., 2017

Speeding up the optimal method of Drezner for the p-centre problem in the plane.
Eur. J. Oper. Res., 2017

The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search.
Comput. Oper. Res., 2017

An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem.
Comput. Oper. Res., 2017

Incorporating neighborhood reduction for the solution of the planar p-median problem.
Ann. Oper. Res., 2017

2016
Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems.
J. Heuristics, 2016

A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem.
Expert Syst. Appl., 2016

Drezner's Exact Method for the Continuous p-Centre Problem Revisited.
Electron. Notes Discret. Math., 2016

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.
Comput. Oper. Res., 2016

The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques.
Comput. Oper. Res., 2016

New local searches for solving the multi-source Weber problem.
Ann. Oper. Res., 2016

2015
Solving large p-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search.
J. Glob. Optim., 2015

Solving the planar p-median problem by variable neighborhood and concentric searches.
J. Glob. Optim., 2015

The continuous p-centre problem: An investigation into variable neighbourhood search with memory.
Eur. J. Oper. Res., 2015

Splitting a Giant Tour using Integer Linear Programming.
Electron. Notes Discret. Math., 2015

A quadtree-based allocation method for a class of large discrete Euclidean location problems.
Comput. Oper. Res., 2015

New heuristic algorithms for solving the planar p-median problem.
Comput. Oper. Res., 2015

New MAXCAP related problems: Formulation and model solutions.
Comput. Ind. Eng., 2015

A Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost.
Comput. Ind. Eng., 2015

2014
Handbook of Metaheuristics (2nd edition).
J. Oper. Res. Soc., 2014

An adaptive multiphase approach for large unconditional and conditional p-median problems.
Eur. J. Oper. Res., 2014

A new local search for continuous location problems.
Eur. J. Oper. Res., 2014

The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation.
Comput. Oper. Res., 2014

Editorial.
Comput. Oper. Res., 2014

Location equilibria for a continuous competitive facility location problem under delivered pricing.
Comput. Oper. Res., 2014

Solving capacitated vehicle routing problem by artificial bee colony algorithm.
Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, 2014

2013
The vehicle routing problem with restricted mixing of deliveries and pickups.
J. Sched., 2013

Solving the Mixed Backhauling Vehicle Routing: Problem with Ants.
Int. J. Energy Optim. Eng., 2013

2012
An adaptive search for the response time variability problem.
J. Oper. Res. Soc., 2012

Customer Allocation in Maximum Capture Problems.
J. Math. Model. Algorithms, 2012

Generating good starting solutions for the p-median problem in the plane.
Electron. Notes Discret. Math., 2012

A hierarchical algorithm for the planar single-facility location routing problem.
Comput. Oper. Res., 2012

2011
A hybrid data mining metaheuristic for the <i>p</i>-median problem.
Stat. Anal. Data Min., 2011

Hyper-heuristic approaches for the response time variability problem.
Eur. J. Oper. Res., 2011

A guided reactive GRASP for the capacitated multi-source Weber problem.
Comput. Oper. Res., 2011

2010
Integrating heuristic information into exact methods: The case of the vertex p-centre problem.
J. Oper. Res. Soc., 2010

Performance evaluation of hybrid-CLP vs. GA: non-permutation flowshop with constrained resequencing buffers.
Int. J. Manuf. Technol. Manag., 2010

2009
Heuristics are here to help your online vehicle scheduling.
OR Insight, 2009

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2009

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem.
Eur. J. Oper. Res., 2009

Region-rejection based heuristics for the capacitated multi-source Weber problem.
Comput. Oper. Res., 2009

Local improvement in planar facility location using vehicle routing.
Ann. Oper. Res., 2009

A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Proceedings of the SIAM International Conference on Data Mining, 2009

2007
Inventory routing problems: a logistical overview.
J. Oper. Res. Soc., 2007

A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips.
J. Math. Model. Algorithms, 2007

A perturbation-based heuristic for the capacitated multisource Weber problem.
Eur. J. Oper. Res., 2007

Location-routing: Issues, models and methods.
Eur. J. Oper. Res., 2007

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers.
Proceedings of the Large-Scale Scientific Computing, 6th International Conference, 2007

2006
A multi-objective heuristic approach for the casualty collection points location problem.
J. Oper. Res. Soc., 2006

2005
Enhancements to Two Exact Algorithms for Solving the Vertex <i>P</i>-Center Problem.
J. Math. Model. Algorithms, 2005

Strategies for increasing the efficiency of a genetic algorithm for the structural optimization of nanoalloy clusters.
J. Comput. Chem., 2005

Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries.
Eur. J. Oper. Res., 2005

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost.
Ann. Oper. Res., 2005

2004
Adaptive Hybrid Learning for Neural Networks.
Neural Comput., 2004

The multi-source Weber problem with constant opening cost.
J. Oper. Res. Soc., 2004

A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows.
J. Math. Model. Algorithms, 2004

A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
Eur. J. Oper. Res., 2004

A genetic algorithm based approach to intelligent modelling and control of pH in reactors.
Comput. Chem. Eng., 2004

Development of a Genetic Algorithm for Optimization of Nanoalloys.
Proceedings of the Genetic and Evolutionary Computation, 2004

2003
Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows.
J. Oper. Res. Soc., 2003

A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
Discret. Appl. Math., 2003

A cellular heuristic for the multisource Weber problem.
Comput. Oper. Res., 2003

A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location-Allocation Problem.
Ann. Oper. Res., 2003

2002
A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks.
J. Comb. Optim., 2002

Solving the multiple competitive facilities location problem.
Eur. J. Oper. Res., 2002

Defining tabu list size and aspiration criterion within tabu search methods.
Comput. Oper. Res., 2002

2001
Adaptive Search and the Management of Logistics Systems: Base Models for Learning Agents.
J. Oper. Res. Soc., 2001

Constructive heuristics for the uncapacitated continuous location-allocation problem.
J. Oper. Res. Soc., 2001

Book Selection.
J. Oper. Res. Soc., 2001

Genetic ClusteringL An Adaptive Heuristic for the Multidepot Vehicle Routing Problem.
Appl. Artif. Intell., 2001

2000
The location of protection devices on electrical tree networks: a heuristic approach.
J. Oper. Res. Soc., 2000

Editorial.
Eur. J. Oper. Res., 2000

1999
A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling.
J. Oper. Res. Soc., 1999

1998
Lagrangean heuristics applied to a variety of large capacitated plant location problems.
J. Oper. Res. Soc., 1998

A Tabu Search Approach for the Resource Constrained Project Scheduling Problem.
J. Heuristics, 1998

1997
A Genetic Clustering Method for the Multi-Depot Vehicle Routing Problem.
Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997


  Loading...