Download Computational Logistics: 6th International Conference, ICCL by Francesco Corman, Stefan Voß, Rudy R. Negenborn PDF

By Francesco Corman, Stefan Voß, Rudy R. Negenborn

This ebook constitutes the refereed complaints of the sixth foreign convention on Computational Logistics, ICCL 2015, held in Delft, The Netherlands, in September 2015.

The 50 papers offered during this quantity have been conscientiously reviewed and chosen for inclusion within the booklet. they're geared up in topical sections entitled: delivery over flooring, delivery over water, overseas coordination inside a method, exterior coordination between systems.

Show description

Read Online or Download Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings PDF

Best international_1 books

Basic Cartography for Students and Technicians. Exercise Manual

Uncomplicated Cartography: for college kids and Technicians; workout guide

Foundations of Information and Knowledge Systems: 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008. Proceedings

An amazing textual content for researchers and pros alike, this booklet constitutes the refereed court cases of the fifth foreign Symposium on Foundations of knowledge and information structures, FoIKS 2008 held in Pisa, Italy, in February 2008. The thirteen revised complete papers awarded including 9 revised brief papers and 3 invited lectures have been rigorously chosen in the course of rounds of reviewing and development from seventy nine submissions.

The Learning Curve: How Business Schools Are Re-inventing Education

How do you create world-class academic associations which are academically rigorous and vocationally correct? Are company colleges the blueprint for associations of the long run, oran academic scan long gone fallacious? this can be thefirst identify in a brand new sequence from IE enterprise institution, IE enterprise Publishing .

Hybrid Systems Biology: 5th International Workshop, HSB 2016, Grenoble, France, October 20-21, 2016, Proceedings

This publication constitutes the refereed court cases of the fifth foreign Workshop on Hybrid structures Biology, HSB 2016, held in Grenoble, France, in October 2016. The eleven complete papers awarded during this e-book have been conscientiously reviewed and chosen from 26 submissions. They have been geared up and awarded in four thematic classes additionally mirrored during this booklet: version simulation; version research; discrete and community modelling; stochastic modelling for organic structures.

Extra info for Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings

Example text

Then, we compare the approaches RTR and RTRG on instances where a matching is found only by both RTR and RTRG, hereafter denoted by H. The results are reported in Table 2. In column CI , the average cost-savings in round-trip on set of instances I are shown. In column CH , the average cost-savings in round-trip on set of instances H are shown. The Round-Trip Ridesharing Problem with Relay Stations 27 Table 2. 2 From the Table 2, we can see that the generated cost-saving is significant in both approaches RTR and RTRG compared to CRT for all classes.

In the return trip, the rider d can be matched with the driver j with cost-savings equal to 8 . e, -3 ). The main difficulty here lies in the way of sharing the saved cost, which depends both on the ridershare partners in outgoing and return trips. Note that the sharing procedure of saved cost in not considered in this study. To take into account the total gain in round-trip instead of separate gain in outgoing and return trips, we just need to modify the lines 5, 12 and 20 in Algorithm 2. More precisely, in the lines 5 and 12, we only check the constraints of detour time in outgoing and return trips, respectively.

Figure 3 gets a better visualization of the running time of adding and removing offer. Table 4. 1 Removing offer 10 8 6 4 4 2 2 99 239 549 Number of buckets 99 239 549 Number of buckets Fig. 3. Adding and removing offers depending on the number of buckets and offers in the system. The Round-Trip Ridesharing Problem with Relay Stations 29 Summarizing these results, the two approaches RTI and RTIG provide efficient results in terms of successful matching, cost-savings and running-time. They can also solve the problem of ridesharing with a high number of offers and relay stations within a few seconds of computation time.

Download PDF sample

Rated 4.03 of 5 – based on 45 votes