Abstract Each of our sensory modalities — vision, touch, taste, etc. works on a slightly different timescale, with differing temporal resolutions and processing lag. This raises the question how, or indeed whether, these streams are co-ordinated ‘bound’ into coherent multisensory experience perceptual ‘now’. In this paper I evaluate one account how binding is achieved: windows hypothesis , conc...

This paper presents an improved ant colony optimization algorithm (ACO algorithm) based on Ito differential equations, the proposed algorithm integrates the versatility of Ito thought with the accuracy of ACO algorithm in solving the vehicle routing problem (VRP), and it executes simultaneous move and wave process, and employs exercise ability to unify move and wave intensity. Move and wave ope...

Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, SiteDependent Truck and Trailer Routing Problem with hard and soft Time Windows an...

The problem studied in this article arises from the distribution of soft drinks and collection of recyclable containers in a Quebec based company. It can be modeled as a variant of the vehicle routing problem with a heterogeneous vehicle fleet, time windows, capacity and volume constraints, and an objective function combining routing costs and the revenue resulting from the sale of recyclable m...