In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement approaches based on the idea of changing the neighbourhood structure during the search.

Context and motivation: Cyber-Physical Systems (CPSs) are gaining priority over other systems. The heterogeneity of these systems increases the importance of security. Both the developer and the requirement analyst must consider details of not only the software, but also the hardware perspective, including sensor and network security. Several models for secure software engineering processes have been proposed, but they are limited to software; therefore, to support the processes of security requirements, we need a security requirements framework for CPSs. Question/Problem: Do existing security requirements frameworks fulfil the needs of CPS security requirements? The answer is no; existing security requirements frameworks fail to accommodate security concerns outside of software boundaries. Little or even no attention has been given to sensor, hardware, network, and third party elements during security requirements engineering in different existing frameworks. Principal Ideas/results: We have proposed, applied, and assessed an incremental security requirements evolution approach, which configures the heterogeneous nature of components and their threats in order to generate a secure system. Contribution: The most significant contribution of this paper is to propose a security requirements engineering framework for CPSs that overcomes the issue of security requirements elicitation for heterogeneous CPS components. The proposed framework supports the elicitation of security requirements while considering sensor, receiver protocol, network channel issues, along with software aspects. Furthermore, the proposed CPS framework has been evaluated through a case study, and the results are shown in this paper. The results would provide great support in this research direction.

Summary. Real-life vehicle routing problems encounter a number of complexities that are not considered by the classical models found in the vehicle routing literature. In this paper we consider a dynamic real-life vehicle routing problem which is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, route restrictions associated to orders and vehicles, and drivers' working hours. We propose iterative improvement approaches based on Large Neighborhood Search. Our algorithms are characterised by very fast response times and thus, can be used within dynamic routing systems where input data can change at any time.

Abstract-Many commercial off-the-shelf fleet telematics systems can provide basic tracking & tracing functionalities for vehicle fleets. These systems, however, require that dispatchers manually identify any discrepancies between the actual data available in the fleet telematics system and the planned data in the logistics system. Furthermore, actual data such as arrival and departure times at customer locations must be transferred manually between the fleet telematics system and the logistics system. In this paper we present a Fleet Monitoring System which can be used for advanced tracking of commercial vehicles. The Fleet Monitoring System can analyse messages sent from the vehicles in order to identify discrepancies between actual and planned data. Furthermore, it can be used to revise the planned data and to update the database of the logistics system, e.g. to store exact arrival and departure times at customer locations. As unexpected incidents and ambiguities are automatically detected, dispatchers do not need to manually analyse all messages sent by the vehicles and can quickly react on possible disturbances in the transportation processes.

Summary.No matter which tools, techniques, and methodologies are used for software development, it remains an error-prone process. Nevertheless, changing such important constituents of the software process surely has an effect on the types of faults inherent in the developed software. For instance, some types of faults are typical for structured development, whereas others are typical for object-oriented development.This chapter explores the question of whether component-based software requires new testing techniques, and proposes an integrated testing technique. This technique integrates various tasks during testing component-based software: whiteand black-box testing of the main component (i.e., the top level component controlling the other components), black-box testing of components, black-box testing of the middleware and integration testing of the main component with other components.Benefits of this technique are shown using a real-world example: the technique is automatable and applicable to existing component-based software.

No abstract

Abstract-Although of particular importance for many reallife applications, restrictions to drivers' working hours have only received very little attention in the vehicle routing literature. Regulations regarding drivers' working hours often have a big impact on total travel times, i.e. the time required for driving, breaks, and rest periods. In this paper we describe the regulations for drivers' working hours in the European Union. We present the Vehicle Routing Problem with Drivers' Working Hours (VRPDWH) which generalises the well-known Vehicle Routing Problem with Time Windows. We present a Large Neighbourhood Search algorithm and test cases for the VRPDWH and conclude this paper with computational experiments.

No abstract