Saïd Salhi
Orcid: 0000-0002-3384-5240Affiliations:
- University of Kent, United Kingdom
According to our database1,
Saïd Salhi
authored at least 105 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
8
4
3
3
4
5
1
5
6
8
6
2
4
3
2
5
4
1
4
5
4
3
4
2
1
2
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on kent.ac.uk
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Optim. Lett., May, 2024
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
Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: Mathematical model and adaptive variable neighborhood search with neighborhood categorization.
Eur. J. Oper. Res., 2024
An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem.
Comput. Oper. Res., 2024
A dry port hub-and-spoke network design: An optimization model, solution method, and application.
Comput. Oper. Res., 2024
Optimization of a Last Mile Delivery Model with a Truck and a Drone Using Mathematical Formulation and a VNS Algorithm.
Proceedings of the Metaheuristics - 15th International Conference, 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
Comput. Oper. Res., July, 2023
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
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
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
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
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
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
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
Electron. Notes Discret. Math., 2015
A quadtree-based allocation method for a class of large discrete Euclidean location problems.
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
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
An adaptive multiphase approach for large unconditional and conditional p-median 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
Location equilibria for a continuous competitive facility location problem under delivered pricing.
Comput. Oper. Res., 2014
Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, 2014
2013
J. Sched., 2013
Int. J. Energy Optim. Eng., 2013
2012
J. Oper. Res. Soc., 2012
Electron. Notes Discret. Math., 2012
Comput. Oper. Res., 2012
2011
Stat. Anal. Data Min., 2011
Eur. J. Oper. Res., 2011
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
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
Comput. Oper. Res., 2009
Ann. Oper. Res., 2009
Proceedings of the SIAM International Conference on Data Mining, 2009
2007
J. Math. Model. Algorithms, 2007
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
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
Ann. Oper. Res., 2005
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
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 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
Eur. J. Oper. Res., 2002
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
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
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
J. Heuristics, 1998
1997
Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997