default search action
Niaz A. Wassan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Jeeu Fong Sze
, Saïd Salhi, Niaz A. Wassan:
An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem. Comput. Oper. Res. 164: 106531 (2024) - 2020
- [j14]Saïd Salhi
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. 158: 113574 (2020)
2010 – 2019
- 2018
- [j13]Trung Hieu Tran
An efficient heuristic algorithm for the alternative-fuel station location problem. Eur. J. Oper. Res. 269(1): 159-170 (2018) - [j12]Lina Simeonova, Niaz A. Wassan, Saïd Salhi
The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory. Expert Syst. Appl. 114: 183-195 (2018) - 2017
- [j11]Naveed Wassan, Niaz A. Wassan, Gábor Nagy, Saïd Salhi
The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search. Comput. Oper. Res. 78: 454-467 (2017) - 2016
- [j10]Jeeu Fong Sze
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem. Expert Syst. Appl. 65: 383-397 (2016) - 2015
- [j9]Gábor Nagy, Niaz A. Wassan, Maria Grazia Speranza
The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transp. Sci. 49(2): 271-294 (2015) - 2014
- [j8]Saïd Salhi
The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52: 315-325 (2014) - 2013
- [j7]Niaz A. Wassan, Saïd Salhi, Gábor Nagy, Naveed Wassan, Anne C. Wade:
Solving the Mixed Backhauling Vehicle Routing: Problem with Ants. Int. J. Energy Optim. Eng. 2(2): 62-77 (2013) - [j6]Gábor Nagy, Niaz A. Wassan, Saïd Salhi
The vehicle routing problem with restricted mixing of deliveries and pickups. J. Sched. 16(2): 199-213 (2013)
2000 – 2009
- 2009
- [j5]Arif Imran
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 197(2): 509-518 (2009) - 2008
- [j4]Niaz A. Wassan, A. Hameed Wassan, Gábor Nagy:
A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Comb. Optim. 15(4): 368-386 (2008) - [j3]Niaz A. Wassan, Gábor Nagy, Samad Ahmadi:
A heuristic method for the vehicle routing problem with mixed deliveries and pickups. J. Sched. 11(2): 149-161 (2008) - 2006
- [j2]Niaz A. Wassan:
A reactive tabu search for the vehicle routing problem. J. Oper. Res. Soc. 57(1): 111-116 (2006) - 2002
- [j1]Niaz A. Wassan, Ibrahim H. Osman:
Tabu search variants for the mix fleet vehicle routing problem. J. Oper. Res. Soc. 53(7): 768-782 (2002)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: