Variable Neighborhood Search: 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers (Theoretical Computer Science and General Issues)

Preface
Organization
Contents
A Reduced Variable Neighborhood Search Approach for Feature Selection in Cancer Classification
	1 Introduction
	2 Related Work
	3 Research Methodology
		3.1 Reduced Variable Neighborhood Search
		3.2 Recursive Feature Elimination
		3.3 Learning Algorithms
		3.4 Hybrid RFE-RVNS Method
	4 Experimental Results and Comparison
		4.1 Parameter Settings
		4.2 Data Description and Preprocessing
		4.3 Performance of RFE-RVNS and RVNS
		4.4 Comparison
	5 Conclusions and Future Work
	References
Basic VNS for a Variant of the Online Order Batching Problem
	1 Introduction
	2 State of the Art
		2.1 Batching State-of-the-Art Algorithm for the OOBPMP
		2.2 Routing Algorithms
	3 Algorithmic Proposal
		3.1 Constructive Procedure
		3.2 Shake Procedure
		3.3 Local Search Procedure
	4 Results
	5 Conclusions
	A  Best-Known Values per Instance
	References
A VNS-Based Algorithm for the Mammography Unit Location Problem
	1 Introduction
	2 Literature Review
	3 Problem Statement
	4 Mathematical Formulation
	5 The Proposed VNS Algorithm
		5.1 Variable Neighborhood Search
		5.2 Solution Representation
		5.3 Evaluate Function
		5.4 Initial Solution
		5.5 Neighborhood Structure
		5.6 Local Search
		5.7 Shaking Procedure
	6 Computational Experiments
	7 Conclusions and Future Work
	References
A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem
	1 Introduction
	2 Literature Review
	3 Formal Definition
	4 Heuristic Approach
		4.1 Solution Representation
		4.2 Solution Evaluation
		4.3 Neighborhood Structures
		4.4 Variable Neighborhood Search
		4.5 Set Covering
	5 Computational Experiments
		5.1 Instances Description
		5.2 Experimental Results
	6 Conclusions
	References
Multi-objective Basic Variable Neighborhood Search for Portfolio Selection
	1 Introduction
	2 Problem Formulation
	3 A Heuristic for the Portfolio Selection Problem
	4 Computational Experiments
	5 Concluding Remarks
	References
Local Search Approach for the (r|p)-Centroid Problem Under 1 Metric
	1 Introduction
	2 Mathematical Model
	3 Follower\'s Problem
	4 Local Search Algorithm
	5 Computational Experiments
	6 Conclusion
	References
Optimization of Maintenance Planning and Routing Problems
	1 Introduction
	2 Literature Review
	3 Problem Definition and Formulation
		3.1 Notation of the Joint Maintenance and Routing Problem
		3.2 The Maintenance Model
		3.3 The Routing Model with Maintenance Considerations
	4 Variable Neighborhood Search
		4.1 Representation of the Solution and Constraints Handling
		4.2 Greedy Constructive Heuristics for the Initial Solutions
		4.3 Variable Neighborhood Descent, Best Improvement Local Search and Shaking
		4.4 Neighborhood Structures
	5 Computational Results
		5.1 Instances Description
		5.2 Numerical Results
	6 Conclusion
	References
Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server
	1 Introduction
	2 Variable Neighborhood Search
		2.1 Initial Solution
		2.2 Neighborhood Structures for the Pm,S1|pj,sj|Cmax
		2.3 Shaking and Local Search
		2.4 VNS Algorithm
	3 Lower Bound
	4 Computational Results
		4.1 Benchmark Description
		4.2 Comparison Between VNS and the MIP Model
		4.3 Comparison Between VNS and Benchmark Algorithms
	5 Conclusion
	References
Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem
	1 Introduction
	2 Uncapacitated Single Allocation p-Hub Maximal Covering Problem
	3 Basic Variable Neighborhood Search Algorithm
	4 Computational Experiments
		4.1 Instances Description
		4.2 Results and Discussion
	5 Conclusions and Remarks
	References
A Variable Neighborhood Search Algorithmic Approach for Estimating MDHMM Parameters and Application in Credit Risk Evaluation for Online Peer-to-Peer (P2P) Lending
	1 Introduction
	2 Literature Review
		2.1 Credit Scoring in P2P Lending
		2.2 Metaheuristics for Hidden Markov Models Training
	3 Methodology
		3.1 Hidden Markov Model
		3.2 Multi Dimensional HMM
		3.3 VNS Algorithm
		3.4 Estimating MDHMM Parameters Using BW and VNS for the Credit Scoring Problem
	4 Experimental Setup
		4.1 Data Description
		4.2 K Fold Corss Validation
		4.3 Evaluation Metrics
		4.4 Computation
		4.5 Experiments Results
	5 Conclusion and Future Research
	References
A Multi-objective Metaheuristic for a Green UAV Grid Routing Problem
	1 Introduction
	2 Problem Description
		2.1 Objectives
		2.2 Constraints
		2.3 Variables
	3 Methodology
		3.1 Construction
		3.2 VND Local Search
		3.3 Acceptance Criterion
		3.4 VND Implementation
	4 Computational Experiments
		4.1 Comparison Measures
		4.2 Computational Results
	5 Conclusions
	References
A VNS Approach for Batch Sequencing and Route Planning in Manual Picking System with Time Windows
	1 Introduction
	2 Literature Review
	3 Problem Formulation
	4 VNS Algorithm
	5 Conclusions and the Future Work
	References
Daily Scheduling and Routing of Home Health Care with Multiple Availability Periods of Patients
	1 Introduction and Literature Review
	2 Problem Statement
	3 Mathematical Formulation
		3.1 Parameters
		3.2 Decision Variables
		3.3 Mathematical Model
	4 Variable Search Neighborhood
		4.1 Encoding
		4.2 Decoding
		4.3 Neighborhoods
		4.4 Shaking
		4.5 Local Search
		4.6 Initial Solution
		4.7 GVNS Algorithm
	5 Numerical Experiments
		5.1 Test Instances
		5.2 Computational Results
	6 Conclusion
	References
Author Index