Create a free account and describe your company. With the trial, CanPursue checks every opportunity against it and explains the fit.
Create free accountCreate a free account to see past contracts like this one: who won and at what price.
Create free accountNOTICE OF PROPOSED PROCUREMENT
File Number: W8486-260592/A Tier: 1 (< $3.75M)
This requirement is for the Department of National Defence (DND) for the provision of Shuttle Services between Indigo Parking – Boulevard de la Carrière, National Printing Bureau (45 Boulevard Sacre-Coeur) and 105 rue Hôtel-de-Ville, Gatineau, Québec.
Time Frame of Delivery: January 2026
Documents may be submitted in either official language of Canada.
RFP documents will be posted on CanadaBuys by the Contracting Authority. Bidders are advised that the RFP documents are available on CanadaBuys Tender Management Application website: Homepage | CanadaBuys (https://canadabuys.canada.ca/en?utm_source=canadabuys&utm_medium=ybanner&utm_campaign=ybanner20210305en1)
ADDITIONAL INFORMATION FOR BIDDERS
For services requirements, Bidders must provide the required information as detailed in article 2.3 of Part 2 of the bid solicitation, in order to comply with Treasury Board policies and directives on contracts awarded to former public servants.
Region: National Capital Region
Specific Location: • Indigo Parking – Boulevard de la Carrière, Gatineau, Québec • 45 Boulevard Sacré-Cœur, Gatineau, Québec • 105 rue Hôtel-de-Ville, Gatineau, Québec
BIDDERS’ INQUIRIES
Inquiries regarding this Request for Proposal requirement must be submitted to the Contracting Authority:
Name: Kelsey Lawrence Email: kelsey.lawrence2@forces.gc.ca
The Crown retains the rights to negotiate with suppliers on any procurement.
Not stated in the notice: procurement type, procurement method, selection criteria, region of delivery, region of opportunity, expected contract period, end user
The source reports 2 amendments. CanPursue observed 1 of them with dates.
No attachments listed in the open data.
No contact listed in the open data.