Bassem Jarboui

Orcid: 0000-0002-0372-6101

Affiliations:
  • University of Sfax


According to our database1, Bassem Jarboui authored at least 53 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup.
Int. Trans. Oper. Res., May, 2024

2023
Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits.
Optim. Lett., December, 2023

How to Use K-means for Big Data Clustering?
Pattern Recognit., May, 2023

Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities.
Int. J. Math. Oper. Res., 2023

2022
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems.
Optim. Lett., 2022

Variable neighborhood programming for symbolic regression.
Optim. Lett., 2022

Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming.
Optim. Lett., 2022

A matheuristic for the 0-1 generalized quadratic multiple knapsack problem.
Optim. Lett., 2022

Big-means: Less is More for K-means Clustering.
CoRR, 2022

2021
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance.
Oper. Res., 2021

Solving the joint production distribution problem by the variable neighbourhood search algorithm.
Int. J. Math. Oper. Res., 2021

Analysis of Six Different GP-Tree Neighborhood Structures.
Proceedings of the Intelligent Systems Design and Applications, 2021

2020
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem.
Int. Trans. Oper. Res., 2020

2019
A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem.
Ann. Oper. Res., 2019

Hybrid Genetic Algorithm for Home Healthcare routing and scheduling problem.
Proceedings of the 6th International Conference on Control, 2019

2018
Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints.
Comput. Ind. Eng., 2018

A GVNS Algorithm to Solve VRP with Optional Visits.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

A General Variable Neighborhood Search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Variable Neighborhood Programming For Evolving Discriminent Functions With Dynamic Thresholds.
Proceedings of the 2018 International Conference on Machine Learning and Cybernetics, 2018

2017
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem.
Int. Trans. Oper. Res., 2017

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion.
Int. J. Math. Oper. Res., 2017

GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem.
Electron. Notes Discret. Math., 2017

New VNP for automatic programming.
Electron. Notes Discret. Math., 2017

A variable neighborhood search algorithm for the capacitated vehicle routing problem.
Electron. Notes Discret. Math., 2017

A general variable neighborhood search for the swap-body vehicle routing problem.
Comput. Oper. Res., 2017

Special issue on Variable neighborhood search methods in business and engineering.
Comput. Oper. Res., 2017

2016
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem.
J. Comput. Des. Eng., 2016

2015
0 - 1 Quadratic Knapsack Problem solved with VNS algorithm.
Electron. Notes Discret. Math., 2015

A variable neighborhood search for solving the multi-vehicle covering tour problem.
Electron. Notes Discret. Math., 2015

3rd International Conference on Variable Neighborhood Search (VNS'14).
Electron. Notes Discret. Math., 2015

A variable neighborhood search algorithm for the vehicle routing problem with multiple trips.
Electron. Notes Discret. Math., 2015

Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res., 2015

2014
A two phase variable neighborhood search for the multi-product inventory routing problem.
Comput. Oper. Res., 2014

The classroom assignment problem: Complexity, size reduction and heuristics.
Appl. Soft Comput., 2014

2013
Variable neighborhood search for location routing.
Comput. Oper. Res., 2013

2012
A differential evolution algorithm to solve redundancy allocation problems.
Int. Trans. Oper. Res., 2012

Genetic algorithm with iterated local search for solving a location-routing problem.
Expert Syst. Appl., 2012

A variable neighborhood search for the multi-product inventory routing problem.
Electron. Notes Discret. Math., 2012

A GRASP based on DE to solve single machine scheduling problem with SDST.
Comput. Optim. Appl., 2012

2011
A fuzzy logic control using a differential evolution algorithm aimed at modelling the financial market dynamics.
Inf. Sci., 2011

A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times.
Comput. Oper. Res., 2011

2010
A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem.
J. Comput. Sci., 2010

Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines.
Electron. Notes Discret. Math., 2010

An Iterated Local Search for Solving A Location-Routing Problem.
Electron. Notes Discret. Math., 2010

A genetic algorithms to solve the bicriteria shortest path problem.
Electron. Notes Discret. Math., 2010

A new destructive bounding scheme for the bin packing problem.
Ann. Oper. Res., 2010

2009
An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers.
Proceedings of the Natural Intelligence for Scheduling, Planning and Packing Problems, 2009

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems.
Comput. Oper. Res., 2009

Differential evolution for solving multi-mode resource-constrained project scheduling problems.
Comput. Oper. Res., 2009

2008
A combinatorial particle swarm optimisation for solving permutation flowshop problems.
Comput. Ind. Eng., 2008

A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems.
Appl. Math. Comput., 2008

2007
Combinatorial particle swarm optimization (CPSO) for partitional clustering problem.
Appl. Math. Comput., 2007


  Loading...